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