1 |
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ...
|
|
|
|
BASE
|
|
Show details
|
|
6 |
Cartesian Tree Matching and Indexing
|
|
Park, Sung Gwan; Amir, Amihood; Landau, Gad M.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
|
|
BASE
|
|
Show details
|
|
8 |
Sufficient Conditions for Efficient Indexing Under Different Matchings
|
|
Amir, Amihood; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 2019
|
|
BASE
|
|
Show details
|
|
12 |
Sufficient Conditions for Efficient Indexing Under Different Matchings ...
|
|
|
|
BASE
|
|
Show details
|
|
13 |
Locally Maximal Common Factors as a Tool for Efficient Dynamic String Algorithms
|
|
Amir, Amihood; Boneh, Itai. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. Annual Symposium on Combinatorial Pattern Matching (CPM 2018), 2018
|
|
BASE
|
|
Show details
|
|
14 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap
|
|
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th International Symposium on Algorithms and Computation (ISAAC 2016), 2016
|
|
BASE
|
|
Show details
|
|
15 |
Mind the Gap: Essentially Optimal Algorithms for Online Dictionary Matching with One Gap ...
|
|
|
|
BASE
|
|
Show details
|
|
17 |
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|