No. |
Title |
Author |
Year |
1 |
Computing Covers of 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2021 |
2 |
Hardness of Detecting Abelian and Additive Square Factors in Strings |
Radoszewski, Jakub et al. |
2021 |
3 |
Counting Distinct Patterns in Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2020 |
4 |
The Number of Repetitions in 2D-Strings |
Charalampopoulos, Panagiotis et al. |
2020 |
5 |
Unary Words Have the Smallest Levenshtein k-Neighbourhoods |
Charalampopoulos, Panagiotis et al. |
2020 |
6 |
Internal Dictionary Matching |
Charalampopoulos, Panagiotis et al. |
2019 |
7 |
Quasi-Linear-Time Algorithm for Longest Common Circular Factor |
Alzamel, Mai et al. |
2019 |
8 |
Linear-Time Algorithm for Long LCF with k Mismatches |
Charalampopoulos, Panagiotis et al. |
2018 |
9 |
String Periods in the Order-Preserving Model |
Gourdel, Garance et al. |
2018 |
10 |
Faster Longest Common Extension Queries in Strings over General Alphabets |
Gawrychowski, Pawel et al. |
2016 |
11 |
Improved Algorithms for the Range Next Value Problem and Applications |
Iliopoulos, Costas S. et al. |
2008 |