| No. |
Title |
Author |
Year |
| 1 |
Linear-Time Computation of Shortest Covers of All Rotations of a String |
Crochemore, Maxime et al. |
2022 |
| 2 |
Finding the Anticover of a String |
Alzamel, Mai et al. |
2020 |
| 3 |
Computing the Antiperiod(s) of a String |
Alamro, Hayam et al. |
2019 |
| 4 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |
| 5 |
Degenerate String Comparison and Applications |
Alzamel, Mai et al. |
2018 |
| 6 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
| 7 |
Front Matter, Table of Contents, Preface, Conference Organization, External Reviewers |
Iliopoulos, Costas S. et al. |
2017 |
| 8 |
LIPIcs, Volume 75, SEA'17, Complete Volume |
Iliopoulos, Costas S. et al. |
2017 |
| 9 |
On-Line Pattern Matching on Similar Texts |
Grossi, Roberto et al. |
2017 |
| 10 |
Optimal Computation of Overabundant Words |
Almirantis, Yannis et al. |
2017 |
| 11 |
Truly Subquadratic-Time Extension Queries and Periodicity Detection in Strings with Uncertainties |
Iliopoulos, Costas S. et al. |
2016 |
| 12 |
Improved Algorithms for the Range Next Value Problem and Applications |
Iliopoulos, Costas S. et al. |
2008 |
