| No. |
Title |
Author |
Year |
| 1 |
One Drop of Non-Determinism in a Random Deterministic Automaton |
Carayol, Arnaud et al. |
2023 |
| 2 |
Back-To-Front Online Lyndon Forest Construction |
Badkobeh, Golnaz et al. |
2022 |
| 3 |
Weakly-Unambiguous Parikh Automata and Their Link to Holonomic Series |
Bostan, Alin et al. |
2020 |
| 4 |
An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting |
Goaoc, Xavier et al. |
2019 |
| 5 |
Uniform Random Expressions Lack Expressivity |
Koechlin, Florent et al. |
2019 |
| 6 |
On the Worst-Case Complexity of TimSort |
Auger, Nicolas et al. |
2018 |
| 7 |
Gapped Pattern Statistics |
Duchon, Philippe et al. |
2017 |
| 8 |
Estimating Statistics on Words Using Ambiguous Descriptions |
Nicaud, Cyril |
2016 |
| 9 |
Fast Synchronization of Random Automata |
Nicaud, Cyril |
2016 |
| 10 |
Good Predictions Are Worth a Few Comparisons |
Auger, Nicolas et al. |
2016 |
| 11 |
Distribution of the number of accessible states in a random deterministic automaton |
Carayol, Arnaud et al. |
2012 |
| 12 |
Average Analysis of Glushkov Automata under a BST-Like Model |
Nicaud, Cyril et al. |
2010 |
| 13 |
On the Average Complexity of Moore's State Minimization Algorithm |
Bassino, Frederique et al. |
2009 |
