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


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