DE eng

Search in the Catalogues and Directories

Hits 1 – 7 of 7

1
Dynamic Suffix Array with Sub-linear update time and Poly-logarithmic Lookup Time ...
Amir, Amihood; Boneh, Itai. - : arXiv, 2021
BASE
Show details
2
The k-Mappability Problem Revisited ...
Amir, Amihood; Boneh, Itai; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
3
Update Query Time Trade-Off for Dynamic Suffix Arrays ...
Amir, Amihood; Boneh, Itai. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
BASE
Show details
4
Update Query Time Trade-off for dynamic Suffix Arrays ...
Amir, Amihood; Boneh, Itai. - : arXiv, 2020
BASE
Show details
5
Repetition Detection in a Dynamic String
Amir, Amihood; Boneh, Itai; Charalampopoulos, Panagiotis. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2019. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual European Symposium on Algorithms (ESA 2019), 2019
BASE
Show details
6
Repetition Detection in a Dynamic String ...
Amir, Amihood; Boneh, Itai; Charalampopoulos, Panagiotis. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2019
BASE
Show details
7
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

Catalogues
0
0
0
0
0
0
0
Bibliographies
0
0
0
0
0
0
0
0
0
Linked Open Data catalogues
0
Online resources
0
0
0
0
Open access documents
7
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern