| 2020 | AofA | The Complexity of the Approximate Multiple Pattern Matching Problem for Random Strings. | Frdrique Bassino, Tsinjo Rakotoarimalala, Andrea Sportiello |
| 2012 | CPM | An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. | Omar AitMous, Frdrique Bassino, Cyril Nicaud |
| 2012 | STACS | Asymptotic enumeration of Minimal Automata. | Frdrique Bassino, Julien David, Andrea Sportiello |
| 2010 | CPM | Building the Minimal Automaton of | Omar AitMous, Frdrique Bassino, Cyril Nicaud |
| 2010 | LATIN | Complexity of Operations on Cofinite Languages. | Frdrique Bassino, Laura Giambruno, Cyril Nicaud |
| 2009 | STACS | On the Average Complexity of Moore's State Minimization Algorithm. | Frdrique Bassino, Julien David, Cyril Nicaud |
| 2008 | DLT | The Average State Complexity of the Star of a Finite Set of Words Is Linear. | Frdrique Bassino, Laura Giambruno, Cyril Nicaud |
| 2006 | DCC | Optimal Prefix Codes for Some Families of Two-Dimensional Geometric Distributions. | Frdrique Bassino, Julien Clment, Gadiel Seroussi, Alfredo Viola |
| 2006 | ISIT | Optimal prefix codes for pairs of geometrically-distributed random variables. | Frdrique Bassino, Julien Clment, Gadiel Seroussi, Alfredo Viola |
| 2004 | LATIN | Automata for Arithmetic Meyer Sets. | Shigeki Akiyama, Frdrique Bassino, Christiane Frougny |
| 2004 | SODA | Lyndon words with a fixed standard right factor. | Frdrique Bassino, Julien Clment, Cyril Nicaud |
| 2002 | DLT | The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. | Frdrique Bassino, Julien Clment, Cyril Nicaud |
| 2002 | LATIN | Beta-Expansions for Cubic Pisot Numbers. | Frdrique Bassino |
| 1998 | LATIN | Super-State Automata and Rational Trees. | Frdrique Bassino, Marie-Pierre Bal, Dominique Perrin |
| 1997 | ICALP | Enumerative Sequences of Leaves in Rational Trees. | Frdrique Bassino, Marie-Pierre Bal, Dominique Perrin |
| 1996 | STACS | Star-Height of an N-Rational Series. | Frdrique Bassino |