CNRS Sorbonne Paris Nord University LIPN MathSTIC Research Federation

Publications

← Back to homepage

Book

  1. Frédérique Bassino, Ilya Kapovich, Markus Lohrey, Alexei Myasnikov, Cyril Nicaud, Andrey Nikolaev, Igor Rivin, Vladimir Shpilrain, Alexander Ushakov and Pascal Weil. Complexity and Randomness in Group Theory. 374+xii pages. De Gruyter. June 2020.

Journals

  1. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot. Dense and nondense limits for uniform random intersection graphs. The Electronic Journal of Probability. 31: 1-44, article no. 110 (2026).
  2. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Silhouettes and generic properties of subgroups of the modular group. Groups, Geometry, and Dynamics. 31 pages. Preprint arXiv:2311.08021. To appear.
  3. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot. Scaling limit of graph classes through split decomposition. Australasian Journal of Combinatorics. 92 (part 3): 266-310. 2025.
  4. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Random generation of subgroups of the modular group with a fixed isomorphism type. The Electronic Journal of Combinatorics. 31 (4), P4.7, 27 pages. 2024.
  5. Frédérique Bassino, Mathilde Bouvel, Michael Drmota, Valentin Féray, Lucas Gerin, Mickael Maazoun and Adeline Pierrot. Linear-sized independent sets in random cographs and increasing subsequences in separable permutations. Combinatorial Theory. 2(3), 35 pages. 2022.
  6. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickael Maazoun and Adeline Pierrot. Scaling limits of permutation classes with a finite specification: a dichotomy. Advances in Mathematics. 405, Article 108513, 84 pages. 2022.
  7. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickael Maazoun and Adeline Pierrot. Random cographs: Brownian graphon limit and asymptotic degree distribution. Random Structures and Algorithms. 60 (2): 166-200. 2022.
  8. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Statistics of subgroups of the modular group. International Journal of Algebra and Computation. 31 (8): 1691-1751. 2021.
  9. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Random presentations and random subgroups: a survey. Complexity and Randomness in Group Theory. De Gruyter. p. 45-75. 2020.
  10. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickael Maazoun and Adeline Pierrot. Universal limits of substitution-closed permutation classes. Journal of the European Mathematical Society. 22 (11): 3565-3639. 2020.
  11. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot. The Brownian limit of separable permutations. Annals of Probability. 46 (4): 2134-2189. 2018.
  12. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau and Dominique Rossin. An algorithm for computing combinatorial specifications of permutations classe. Discrete Applied Mathematics. 224: 16-44. 2017.
  13. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Generic properties of free groups and finite presentations. Contemporary Mathematics. vol. 677. Algebra and Computer Science. p. 1-44. 2016.
  14. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. On the genericity of Whitehead minimality. Journal of Group Theory. 19: 137–159. 2016.
  15. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, and Dominique Rossin. An algorithm for deciding the finiteness of the number of simple permutations in permutation classes. Advances in Applied Mathematics. 64: 124–200. 2015.
  16. Frédérique Bassino, Julien Clément, Gadiel Seroussi, and Alfredo Viola. Optimal prefix codes for pairs of geometrically-distributed random variables. IEEE Transactions on Information Theory. 59 (4): 2375–2395. 2013.
  17. Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, and Pascal Weil. Statistical properties of subgroups of free groups. Random Structures and Algorithms. 42 (3): 349–373. 2013.
  18. Frédérique Bassino, Julien Clément, and Pierre Nicodème. Counting occurrences for a finite set of words: combinatorial methods. ACM Transactions on Algorithms. 8 (3), #31, 28 pages. 2012.
  19. Frédérique Bassino, Julien David, and Cyril Nicaud. Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica. 63 (1-2): 509–531. 2012.
  20. Frédérique Bassino, Mathilde Bouvel, and Dominique Rossin. Enumeration of pin-permutations. The Electronic Journal of Combinatorics. 18 (1), P57. 39 pages. 2011.
  21. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, and Dominique Rossin. Deciding the finiteness of the number of simple permutations contained in a wreath-closed class is polynomial. Pure Mathematics and Applications. 21 (2): 119–135. 2010.
  22. Frédérique Bassino, Laura Giambruno, and Cyril Nicaud. The average state complexity of rational operations on finite languages. International Journal of Foundations of Computer Science. 21 (4): 495–516. 2010.
  23. Frédérique Bassino, Julien David, and Cyril Nicaud. Enumeration and random generation of possibly incomplete deterministic automata. Pure Mathematics and Applications. 19 (2-3): 1–16. 2008.
  24. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Random generation of finitely generated subgroups of a free group. International Journal of Algebra and Computation. 18: 375–405. 2008.
  25. Frédérique Bassino and Cyril Nicaud. Enumeration and Random Generation of Accessible Automata. Theoretical Computer Science. 381: 86–104. 2007.
  26. Shigeki Akiyama, Frédérique Bassino, and Christiane Frougny. Arithmetic Meyer sets and finite automata. Information and Computation. 201 (2): 199–215. 2005.
  27. Frédérique Bassino, Julien Clément, and Cyril Nicaud. The Standard Factorization of Lyndon Words: an Average Point of View. Discrete Mathematics. 290 (1): 1–25. 2005.
  28. Frédérique Bassino and Helmut Prodinger. (q,δ)-numeration systems with missing digits. Monatshefte für Mathematik. 141 (2): 89–99. 2004.
  29. Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. A finite state version of the Kraft-McMillan theorem. SIAM Journal on Computing. 30 (4): 1211–1230. 2000.
  30. Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Enumerative sequences of leaves and nodes in rational trees. Theoretical Computer Science. 221 (1-2): 41–60. 1999.
  31. Frédérique Bassino. Generating functions of circular codes. Advances in Applied Mathematics. 22 (1): 1–24. 1999.
  32. Frédérique Bassino. Nonnegative companion matrices and star-height of ℕ-rational series. Theoretical Computer Science. 180 (1-2): 61–80. 1997.

In proceedings

  1. Frédérique Bassino, Tsinjo Rakotoarimalala and Andrea Sportiello. The complexity of the Approximate Multiple Pattern Matching Problem for random strings. The 31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020), Klagenfurt, Austria, vol. 159 Paper #3 in Leibniz International Proceedings in Informatics (LIPIcs), 12 pages. June 2020.
  2. Frédérique Bassino, Andrea Sportiello. Linear-time exact sampling of sum-constrained random variables. The 11th International Conference on Random and Exhaustive Generation of Combinatorial Structures (GASCom 2018). Athens, Greece, CEUR Workshop Proceedings. vol. 2113. 94–105. June 2018.
  3. Frédérique Bassino, Tsinjo Rakotoarimalala and Andrea Sportiello. The complexity of the Multiple Pattern Matching Problem for random strings. The 15th SIAM Meeting on Analytic Algorithmics and Combinatorics (ANALCO'18). New Orleans, Louisiana, pp. 40–53. January 2018.
  4. Frédérique Bassino, and Andrea Sportiello. Linear-time generation of inhomogenous random directed walks. The Twelfth SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO'15). San Diego, California. pp. 51–65. January 2015.
  5. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, and Dominique Rossin. Combinatorial specification of permutation classes. 24th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC'12). Nagoya, Japan. Discrete Mathematics and Theoretical Computer Science Proceedings. pp. 781–792. July 2012.
  6. Omar Ait Mous, Frédérique Bassino, and Cyril Nicaud. An efficient linear pseudo-minimization algorithm for Aho-Corasick automata. 23rd Annual Symposium on Combinatorial Pattern Matching (CPM 2012), vol. 7354 LNCS. pp. 110–123. Springer-Verlag. Helsinki, Finland. July 2012.
  7. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Generic properties of random subgroups of a free group for general distributions. 23rd International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2012), Montréal, Canada. Discrete Mathematics and Theoretical Computer Science Proceedings. pp. 155–166. June 2012.
  8. Frédérique Bassino, Julien David, and Andrea Sportiello. Asymptotic enumeration of minimal automata. 29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012). Paris, France. vol. 14 in Leibniz International Proceedings in Informatics (LIPIcs) pp. 88–99. March 2012.
  9. Omar Ait Mous, Frédérique Bassino, and Cyril Nicaud. Building the Minimal Automaton of A*X in Linear Time, When X Is of Bounded Cardinality. 21st Annual Symposium on Combinatorial Pattern Matching (CPM 2010). New York, United States. vol. 6129. LNCS. pp. 275–287. Springer-Verlag. June 2010.
  10. Frédérique Bassino, Laura Giambruno, and Cyril Nicaud. Complexity of operations on cofinite languages. 9th Latin American Theoretical INformatics Symposium (LATIN 2010). Oaxaca, Mexico. vol. 6034. LNCS. pp. 222–233. Springer-Verlag. April 2010.
  11. Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, and Pascal Weil. On two distributions of subgroups of free groups. The SIAM Workshop on Analytic Algorithmics and Combinatorics (ANALCO'10). Austin, Texas. pp. 82–89. January 2010.
  12. Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, and Dominique Rossin. Deciding the finiteness of simple permutations contained in a wreath-closed class is polynomial. Permutation Patterns 2009 (PP 2009). Florence, Italy. pp. 13–20. July 2009.
  13. Frédérique Bassino, Julien David, and Cyril Nicaud. On the average complexity of Moore's state minimization algorithm. 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009). Freiburg, Germany. vol. 3 in Leibniz International Proceedings in Informatics (LIPIcs) pp. 123–134. February 2009.
  14. Frédérique Bassino, Julien Clément, Julien Fayolle, and Pierre Nicodème. Constructions for Clumps Statistics. 5th International Colloquium on Mathematics and Computer Science (MathInfo'08). vol. AG. Discrete Mathematics and Theoretical Computer Science Proceedings. Blaubeuren, Germany. pp. 183–198. September 2008.
  15. Frédérique Bassino, Laura Giambruno, and Cyril Nicaud. The average state complexity of the star of a finite set of words is linear. International Conference on Developments in Language Theory (DLT'08). vol. 5257. LNCS. Kyoto, Japan. pp. 134–145. Springer-Verlag. September 2008.
  16. Frédérique Bassino, Julien David, and Cyril Nicaud. Random generation of possibly incomplete deterministic automata. Génération Aléatoire de Structures COMbinatoires (Gascom'08). Bibbiena, Italy. pp. 31–40. June 2008.
  17. Frédérique Bassino, Julien David, and Cyril Nicaud. REGAL: a library to randomly and exhaustively generate automata. In, Jan Holub, Jan Žďárek, editors, 12th International Conference on Implementation and Application of Automata (CIAA'07). vol. 4783. LNCS. Prague, Czech Republic. pp. 303–305. Springer-Verlag. July 2007.
  18. Frédérique Bassino, Julien Clément, Julien Fayolle, and Pierre Nicodème. Counting occurrences for a finite set of words: an inclusion-exclusion approach. Conference on Analysis of Algorithms (AofA'07). Juan les Pins, France. vol. AH. Discrete Mathematics and Theoretical Computer Science Proceedings. pp. 29–44. June 2007.
  19. Frédérique Bassino and Cyril Nicaud. Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers. International Colloquium on Mathematics and Computer Science 2006. Nancy, France. vol. AG. Discrete Mathematics and Theoretical Computer Science Proceedings. pp. 151–160. September 2006.
  20. Frédérique Bassino, Julien Clément, Gadiel Seroussi, and Alfredo Viola. Optimal prefix codes for pairs of geometrically-distributed random variables. IEEE International Symposium on Information Theory (ISIT'06). pp. 2667–2671. Seattle, Washington. July 2006.
  21. Frédérique Bassino, Julien Clément, Gadiel Seroussi, and Alfredo Viola. Optimal prefix codes for some families of two-dimensional geometric distributions. Data Compression Conference (DCC'06). Snowbird, Utah. pp. 113–122. IEEE Computer Society Press. March 2006.
  22. Shigeki Akiyama, Frédérique Bassino, and Christiane Frougny. Automata for arithmetic Meyer sets. 6th Latin American Theoretical INformatics Symposium (LATIN'04). vol. 2976. LNCS. Buenos Aires, Argentina. pp. 252–261. Springer-Verlag. April 2004.
  23. Frédérique Bassino, Julien Clément, and Cyril Nicaud. Lyndon words with a fixed standard right factor. In, J. Ian Munro, editors, 15th ACM-SIAM Annual Symposium on Discrete Algorithms (SODA 2004). New Orleans, Louisiana, USA. pp. 646–647. SIAM. January 2004.
  24. Frédérique Bassino, Julien Clément, and Cyril Nicaud. The average lengths of the factors of the standard factorization of Lyndon words. In, Masami Ito, Masafumi Toyama, editors, 6th International Conference on Developments in Language Theory (DLT 2002). vol. 2450. LNCS. Kyoto, Japan. pp. 307–318. Springer-Verlag. September 2003.
  25. Frédérique Bassino. β-expansions for cubic Pisot numbers. 5th Latin American Theoretical INformatics Symposium (LATIN'02). vol. 2286. LNCS. Cancun, Mexico. pp. 141–152. Springer-Verlag. April 2002. Errata.
  26. Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Length distributions and regular sequences. In, Joachim Rosenthal, Brian Marcus, editors, Codes, systems, and graphical models (Minneapolis, MN, 1999). vol. 123. IMA Volumes in Mathematics and its Applications. pp. 415–437. Springer-Verlag. 2001.
  27. Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Super-state automata and rational trees. In, C.L. Lucchesi, A.V. Moura, editors, 3rd Latin American Theoretical INformatics Symposium (LATIN'98). vol. 1380. LNCS. Campinas, Brazil. pp. 42–52. Springer-Verlag. April 1998.
  28. Frédérique Bassino. Distributions de longueurs des codes circulaires. 9-th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC'97). pp. 61–72. 1997.
  29. Frédérique Bassino, Marie-Pierre Béal, and Dominique Perrin. Enumerative sequences of leaves in rational trees. International Colloquium on Automata, Languages and Programming (ICALP 1997). vol. 1256. LNCS. pp. 76–86. Springer-Verlag. 1997.
  30. Frédérique Bassino. Star-height of an ℕ-rational series. In, C. Puech, R. Reischuk, editors, 13th International Symposium on Theoretical Aspects of Computer Science (STACS'96). vol. 1046. LNCS. pp. 125–135. Springer-Verlag. 1996.

Edition of proceedings

  1. Selected papers from LAGOS 2017: IX Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2017). Frédérique Bassino, Flavia Bonomo, Lionel Pournin and Mario Valencia-Pabon. Discrete Applied Mathematics. vol. 281. 2020.
  2. Proceedings of LAGOS 2017: IX Latin-American Algorithms, Graphs, and Optimization Symposium (LAGOS 2017). Frédérique Bassino, Flavia Bonomo, Lionel Pournin, Mario Valencia-Pabon and Juan Vera. Electronic Notes in Discrete Mathematics. vol. 62. 2017.
  3. Selected papers from the 11th Permuation Patterns Conference (PP 2013). Frédérique Bassino, Mathilde Bouvel and Dominique Rossin. Journal of Combinatorics. vol. 6 (1-2). 2015.
  4. Proceedings of the 8th Journées Montoises d'Informatique. Frédérique Bassino, Véronique Bruyère. Bulletin of the Belg. Math. Soc. 2001.

PhD thesis

  1. Frédérique Bassino. Automates, énumération et algorithmes. Habilitation à diriger des recherches (postdoctoral qualification). I.G.M., Université de Marne-la-Vallée. 2005.
  2. Frédérique Bassino. Séries rationnelles et distributions de longueurs. PhD thesis. I.G.M., Université de Marne-la-Vallée. 1996.