No. Title Author Year
1 An Almost Optimal Edit Distance Oracle Charalampopoulos, Panagiotis et al. 2021
2 Computing Covers of 2D-Strings Charalampopoulos, Panagiotis et al. 2021
3 Faster Algorithms for Longest Common Substring Charalampopoulos, Panagiotis et al. 2021
4 Internal Shortest Absent Word Queries Badkobeh, Golnaz et al. 2021
5 Pattern Masking for Dictionary Matching Charalampopoulos, Panagiotis et al. 2021
6 Counting Distinct Patterns in Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2020
7 Dynamic Longest Common Substring in Polylogarithmic Time Charalampopoulos, Panagiotis et al. 2020
8 Dynamic String Alignment Charalampopoulos, Panagiotis et al. 2020
9 Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs Charalampopoulos, Panagiotis et al. 2020
10 The Number of Repetitions in 2D-Strings Charalampopoulos, Panagiotis et al. 2020
11 Unary Words Have the Smallest Levenshtein k-Neighbourhoods Charalampopoulos, Panagiotis et al. 2020
12 Internal Dictionary Matching Charalampopoulos, Panagiotis et al. 2019
13 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
14 Repetition Detection in a Dynamic String Amir, Amihood et al. 2019
15 Linear-Time Algorithm for Long LCF with k Mismatches Charalampopoulos, Panagiotis et al. 2018
16 Optimal Computation of Overabundant Words Almirantis, Yannis et al. 2017
Current Page :
Number of result pages: 1
Number of documents: 16


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