No. Title Author Year
1 Analysis of the Period Recovery Error Bound Amir, Amihood et al. 2020
2 Double String Tandem Repeats Amir, Amihood et al. 2020
3 Update Query Time Trade-Off for Dynamic Suffix Arrays Amir, Amihood et al. 2020
4 Cartesian Tree Matching and Indexing Park, Sung Gwan et al. 2019
5 Longest Common Substring Made Fully Dynamic Amir, Amihood et al. 2019
6 Repetition Detection in a Dynamic String Amir, Amihood et al. 2019
7 Sufficient Conditions for Efficient Indexing Under Different Matchings Amir, Amihood et al. 2019
8 Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms Amir, Amihood et al. 2018
9 Quasi-Periodicity Under Mismatch Errors Amir, Amihood et al. 2018
10 Two-Dimensional Maximal Repetitions Amir, Amihood et al. 2018
11 Approximate Cover of Strings Amir, Amihood et al. 2017
12 Can We Recover the Cover? Amir, Amihood et al. 2017
13 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: 13


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