Université Paris-Nord LIPN :  CALIN CNRS

Publications

Journals

  1. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin, Mickael Maazoun and Adeline Pierrot. Universal limits of substitution-closed permutation classes. 67 pages. June 2017. Submitted.
  2. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. Random presentations and random subgroups: a survey. 35 pages. February 2017. Submitted.
  3. Frédérique Bassino, Mathilde Bouvel, Valentin Féray, Lucas Gerin and Adeline Pierrot. The Brownian limit of separable permutations. 45 pages. February 2017. Submitted.
  4. 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. vol. 224. pp. 16–44.  2017.
  5. 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.  pp. 1–44. 2016.
  6. Frédérique Bassino, Cyril Nicaud, and Pascal Weil. On the genericity of Whitehead minimality. Journal of Group Theory. vol. 19. pp. 137–159.  2016.
  7. 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. vol. 64. pp. 124–200.  2015.
  8. 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. vol. 59 (4). pp. 2375–2395.  2013.
  9. Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, and Pascal Weil. Statistical properties of subgroups of free groups. Random Structures and Algorithms. vol. 42 (3). pp. 349–373.  2013.
  10. 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. vol. 8 (3). #31, 28 pages, 2012.
  11. Frédérique Bassino, Julien David, and Cyril Nicaud. Average Case Analysis of Moore's State Minimization Algorithm. Algorithmica vol. 63 (1-2). pp. 509–531.  2012.
  12. Frédérique Bassino, Mathilde Bouvel, and Dominique Rossin. Enumeration of pin-permutations. The Electronic Journal of Combinatorics. vol. 18 (1). *P57.  39 pages.  2011.
  13. 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. vol. 21 (2). pp. 119–135.   2010.
  14. 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. vol. 21 (4). pp. 495–516.  2010.
  15. Frédérique Bassino, Julien David, and Cyril Nicaud. Enumeration and random generation of possibly incomplete deterministic automata. Pure Mathematics and Applications. vol. 19 (2-3). pp. 1–16.  2008.
  16. 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. vol. 18. pp. 375–405. 2008.
  17. Frédérique Bassino and Cyril Nicaud. Enumeration and Random Generation of Accessible Automata. Theoretical Computer Science. vol. 381. pp. 86–104. 2007.
  18. Shigeki Akiyama, Frédérique Bassino, and Christiane Frougny. Arithmetic Meyer sets and finite automata. Information and Computation. 201 (2). pp. 199–215. 2005.
  19. 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). pp. 1–25.  2005.
  20. Frédérique Bassino and Helmut Prodinger. (q,\delta)-numeration systems with missing digits. Monatshefte für Mathematik. 141 (2). pp. 89–99.  2004.
  21. 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). pp. 1211–1230. 2000.
  22. 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). pp. 41–60.  1999.
  23. Frédérique Bassino. Generating functions of circular codes. Advances in Applied Mathematics. 22 (1). pp. 1–24. 1999.
  24. Frédérique Bassino. Nonnegative companion matrices and star-height of N-rational series. Theoretical Computer Science. 180 (1-2). pp. 61–80. 1997.

In proceedings

  1. 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) (ANALCO'15).  San Diego,  California. pp. 51–65. http://epubs.siam.org/doi/book/10.1137/1.9781611973761. January  2015.
  2. 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. Nagoya, Japan. July 2012.
  3. 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.
  4. 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.
  5. 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. www.stacs-conf.org.  March  2012.
  6. 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.
  7. 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.
  8. 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. www.siam.org/proceedings/analco/2010/analco10.php. January  2010.
  9. 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.
  10. 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. www.stacs-conf.org.  February  2009.
  11. 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.
  12. 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.
  13. 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.
  14. 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.
  15. 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.
  16. 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.
  17. 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.
  18. 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.
  19. 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.
  20. 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.
  21. 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.
  22. Frédérique Bassino. \beta-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.
  23. 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.
  24. 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.
  25. 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.
  26. 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.
  27. Frédérique Bassino. Star-height of an N-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.

Collections, books and book chapters

  1. 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.
  2. 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. I.G.M., Université de Marne-la-Vallée.  2005.
  2. Frédérique Bassino. Séries rationnelles et distributions de longueurs. Thèse de doctorat. I.G.M., Université de Marne-la-Vallée.  1996.

For remarks and comments on these web pages, please contact Frédérique Bassino.