| 2025 | CPM | Branch Prediction Analysis of Morris-Pratt and Knuth-Morris-Pratt Algorithms. | Cyril Nicaud, Carine Pivoteau, Stphane Vialette |
| 2023 | STACS | One Drop of Non-Determinism in a Random Deterministic Automaton. | Arnaud Carayol, Philippe Duchon, Florent Koechlin, Cyril Nicaud |
| 2022 | COCOON | A Probabilistic Model Revealing Shortcomings in Lua's Hybrid Tables. | Conrado Martnez, Cyril Nicaud, Pablo Rotondo |
| 2022 | CPM | Back-To-Front Online Lyndon Forest Construction. | Golnaz Badkobeh, Maxime Crochemore, Jonas Ellert, Cyril Nicaud |
| 2020 | DLT | On the Degeneracy of Random Expressions Specified by Systems of Combinatorial Equations. | Florent Koechlin, Cyril Nicaud, Pablo Rotondo |
| 2020 | ICALP | Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series. | Alin Bostan, Arnaud Carayol, Florent Koechlin, Cyril Nicaud |
| 2019 | MFCS | Uniform Random Expressions Lack Expressivity. | Florent Koechlin, Cyril Nicaud, Pablo Rotondo |
| 2018 | ESA | On the Worst-Case Complexity of TimSort. | Nicolas Auger, Vincent Jug, Cyril Nicaud, Carine Pivoteau |
| 2018 | IWOCA | On the Expected Number of Distinct Gapped Palindromic Factors. | Philippe Duchon, Cyril Nicaud |
| 2018 | LATIN | On the Biased Partial Word Collector Problem. | Philippe Duchon, Cyril Nicaud |
| 2017 | CPM | Gapped Pattern Statistics. | Philippe Duchon, Cyril Nicaud, Carine Pivoteau |
| 2016 | CPM | Estimating Statistics on Words Using Ambiguous Descriptions. | Cyril Nicaud |
| 2016 | STACS | Good Predictions Are Worth a Few Comparisons. | Nicolas Auger, Cyril Nicaud, Carine Pivoteau |
| 2015 | CPM | A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS-Algorithm. | Cyril Nicaud |
| 2014 | DLT | On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. | Sven De Felice, Cyril Nicaud |
| 2014 | MFCS | Random Deterministic Automata. | Cyril Nicaud |
| 2013 | CSR | Random Generation of Deterministic Acyclic Automata Using the Recursive Method. | Sven De Felice, Cyril Nicaud |
| 2013 | DLT | Brzozowski Algorithm Is Generically Super-Polynomial for Deterministic Automata. | Sven De Felice, Cyril Nicaud |
| 2012 | CPM | An Efficient Linear Pseudo-minimization Algorithm for Aho-Corasick Automata. | Omar AitMous, Frdrique Bassino, Cyril Nicaud |
| 2012 | STACS | Distribution of the number of accessible states in a random deterministic automaton. | Arnaud Carayol, Cyril Nicaud |
| 2011 | ICST | Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing. | Pierre-Cyrille Ham, Cyril Nicaud |
| 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 | LATA | On the Average Size of Glushkov's Automata. | 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 |
| 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 |
| 1999 | MFCS | Average State Complexity of Operations on Unary Automata. | Cyril Nicaud |