Nombre de documents

21

CV de Toufik Mansour


Article dans une revue15 documents

  • David Callan, Toufik Mansour, Mark Shattuck. Wilf classification of triples of 4-letter patterns I. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017. <hal-01321512v2>
  • David Callan, Toufik Mansour, Mark Shattuck. Wilf classification of triples of 4-letter patterns II. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2017, pp.6. <hal-01321517v3>
  • Toufik Mansour, Mark Shattuck. On avoidance of patterns of the form σ-τ by words over a finite alphabet. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2015, 17 (2), pp.181-202. <hal-01349055>
  • Toufik Mansour, Mark Shattuck, Mark Wilson. Congruence successions in compositions. Discrete Mathematics and Theoretical Computer ScienceDiscrete Mathematics and Theoretical Computer Science, 2014, 16 (1), pp.327--338. <hal-01179220>
  • Armen Petrossian, Toufik Mansour, Jean-Luc Baril. Equivalence classes of permutations modulo excedances. Journal of Combinatorics, International Press, 2014, 5 (4), pp.453-469. <hal-01134173>
  • Andrei Asinowski, Gill Barequet, Mireille Bousquet-Mélou, Toufik Mansour, Ron Pinter. Orders induced by segments in floorplan partitions and (2-14-3,3-41-2)-avoiding permutations. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2013, 20 (2), pp.P35. <hal-00534068v4>
  • Vincent Vajnovszki, Toufik Mansour. Efficient generation of restricted growth words. Information Processing Letters, Elsevier, 2013, 113 (17), pp.613-616. <hal-00829134>
  • Vincent Vajnovszki, Toufik Mansour, G. Nassar. Loop-free Gray code algorithm for e-restricted growth fonctions. Information Processin Letters, 2011, 111 (11), pp.541-544. <hal-00790765>
  • Toufik Mansour. Enumeration of words by the sum of differences between adjacent letters. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2009, 11 (1), pp.173--185. <hal-00988177>
  • Sergey Kitaev, Toufik Mansour, Jeff Remmel. Counting descents, rises, and levels, with prescribed first element, in words. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2008, 10 (3), pp.1--22. <hal-00972336>
  • Patrice Séébold, Sergey Kitaev, Toufik Mansour. Counting Ordered Patterns in Words Generated by Morphisms. Integers : Electronic Journal of Combinatorial Number Theory, State University of West Georgia, Charles University, and DIMATIA, 2008, 8, pp.28. <lirmm-00382674>
  • Toufik Mansour, Basel O. Sirhan. Counting l-letter subwords in compositions. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2006, 8, pp.285--297. <hal-00961119>
  • Toufik Mansour. On an open problem of Green and Losonczy: exact enumeration of freely braided permutations. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2004, 6 (2), pp.461-470. <hal-00959020>
  • Alexander Burstein, Toufik Mansour. Counting occurrences of some subword patterns. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2003, 6 (1), pp.1-12. <hal-00958999>
  • Toufik Mansour, Alek Vainshtein. Avoiding maximal parabolic subgroups of S_k. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2000, 4 (1), pp.81-90. <hal-00958946>

Communication dans un congrès4 documents

  • Margaret Archibald, Arnold Knopfmacher, Toufik Mansour. Compositions and samples of geometric random variables with constrained multiplicities. Billey, Sara and Reiner, Victor. 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), 2010, San Francisco, United States. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AN, 22nd International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2010), pp.449-460, 2010, DMTCS Proceedings. <hal-01186314>
  • Arnold Knopfmacher, Toufik Mansour. Record statistics in integer compositions. Krattenthaler, Christian and Strehl, Volker and Kauers, Manuel. 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), 2009, Hagenberg, Austria. Discrete Mathematics and Theoretical Computer Science, DMTCS Proceedings vol. AK, 21st International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2009), pp.527-536, 2009, DMTCS Proceedings. <hal-01185383>
  • Mark Dukes, Vít Jelínek, Toufik Mansour, Astrid Reifegerste. Equivalences for pattern avoiding involutions and classification. Krattenthaler, Christian and Sagan, Bruce. 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), 2008, Vi–a del Mar, Chile. Discrete Mathematics and Theoretical Computer Science, AJ, pp.181-188, 2008, DMTCS Proceedings. <hal-01185172>
  • Patrice Séébold, Sergey Kitaev, Toufik Mansour. Counting ordered patterns in words generated by morphisms. Springer-Verlag. LATA'2008: 2nd International Conference on Language and Automata Theory and Applications, Mar 2008, Tarragona, Spain. LNCS (5196), pp.287-298, 2008, <http://grammars.grlmc.com/lata2008/>. <lirmm-00408114>

Pré-publication, Document de travail2 documents

  • Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour. Two by two squares in set partitions. 2016. <hal-01276495>
  • Margaret Archibald, Aubrey Blecher, Charlotte Brennan, Arnold Knopfmacher, Toufik Mansour. Two by two squares in set partitions. 2016. <hal-01278973>