| No. |
Title |
Author |
Year |
| 1 |
Back-To-Front Online Lyndon Forest Construction |
Badkobeh, Golnaz et al. |
2022 |
| 2 |
Linear-Time Computation of Shortest Covers of All Rotations of a String |
Crochemore, Maxime et al. |
2022 |
| 3 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |
| 4 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
| 5 |
Towards Distance-Based Phylogenetic Inference in Average-Case Linear-Time |
Crochemore, Maxime et al. |
2017 |
| 6 |
Combinatorics and Algorithmics of Strings (Dagstuhl Seminar 14111) |
Crochemore, Maxime et al. |
2014 |
| 7 |
Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) |
Crochemore, Maxime et al. |
2011 |
| 8 |
Reverse Engineering Prefix Tables |
Clement, Julien et al. |
2009 |
| 9 |
Improved Algorithms for the Range Next Value Problem and Applications |
Iliopoulos, Costas S. et al. |
2008 |
| 10 |
Understanding Maximal Repetitions in Strings |
Crochemore, Maxime et al. |
2008 |
