No. Title Author Year
1 Counting Distinct Patterns in Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2020
2 Dynamic Longest Common Substring in Polylogarithmic Time Charalampopoulos, Panagiotis et al. 2020
3 Dynamic String Alignment Charalampopoulos, Panagiotis et al. 2020
4 Unary Words Have the Smallest Levenshtein k-Neighbourhoods Charalampopoulos, Panagiotis et al. 2020
5 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
6 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
7 Repetition Detection in a Dynamic String Amir, Amihood et al. 2019
8 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
9 Optimal Computation of Overabundant Words Almirantis, Yannis et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 9


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI