DE eng

Search in the Catalogues and Directories

Hits 1 – 19 of 19

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
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
7
Longest Common Substring Made Fully Dynamic
Amir, Amihood; Charalampopoulos, Panagiotis; Pissis, Solon P.. - : 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
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
9
Cartesian Tree Matching and Indexing ...
BASE
Show details
10
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
11
Cartesian Tree Matching and Indexing ...
Park, Sung Gwan; Amir, Amihood; Landau, Gad M.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2019
BASE
Show details
12
Sufficient Conditions for Efficient Indexing Under Different Matchings ...
Amir, Amihood; Kondratovsky, Eitan. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2019
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 ...
Amir, Amihood; Kopelowitz, Tsvi; Levy, Avivit. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016
BASE
Show details
16
Mind the Gap ...
BASE
Show details
17
Managing Unbounded-Length Keys in Comparison-Driven Data Structures with Applications to On-Line Indexing ...
BASE
Show details
18
Preservation of expressive completeness in temporal models
In: Information and computation. - Amsterdam : Elsevier 72 (1987) 1, 66-83
BLLDB
Show details
19
Separation in nonlinear time models
In: Information and control. - New York, NY [u.a.] : Academ. Pr. 66 (1985) 3, 177-203
BLLDB
Show details

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