No. Title Author Year
1 Cartesian Tree Matching and Indexing Park, Sung Gwan et al. 2019
2 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
3 Repetition Detection in a Dynamic String Amir, Amihood et al. 2019
4 Sufficient Conditions for Efficient Indexing Under Different Matchings Amir, Amihood et al. 2019
5 Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms Amir, Amihood et al. 2018
6 Quasi-Periodicity Under Mismatch Errors Amir, Amihood et al. 2018
7 Two-Dimensional Maximal Repetitions Amir, Amihood et al. 2018
8 Approximate Cover of Strings Amir, Amihood et al. 2017
9 Can We Recover the Cover? Amir, Amihood et al. 2017
10 Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap Amir, Amihood et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Imprint | Privacy Published by LZI