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 Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs Charalampopoulos, Panagiotis et al. 2020
5 The Number of Repetitions in 2D-Strings Charalampopoulos, Panagiotis et al. 2020
6 Unary Words Have the Smallest Levenshtein k-Neighbourhoods Charalampopoulos, Panagiotis et al. 2020
7 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
8 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
9 Repetition Detection in a Dynamic String Amir, Amihood et al. 2019
10 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
11 Optimal Computation of Overabundant Words Almirantis, Yannis et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 11


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