DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 22

1
Dynamic Suffix Array with Polylogarithmic Queries and Updates ...
Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2022
BASE
Show details
2
Faster Algorithms for Longest Common Substring ...
Charalampopoulos, Panagiotis; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
3
Breaking the $O(n)$-Barrier in the Construction of Compressed Suffix Arrays ...
Kempa, Dominik; Kociumaka, Tomasz. - : arXiv, 2021
BASE
Show details
4
Faster Algorithms for Longest Common Substring ...
BASE
Show details
5
Time-Space Tradeoffs for Finding a Long Common Substring ...
BASE
Show details
6
Time-Space Tradeoffs for Finding a Long Common Substring ...
Ben-Nun, Stav; Golan, Shay; Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
BASE
Show details
7
Practical Performance of Space Efficient Data Structures for Longest Common Extensions ...
Dinklage, Patrick; Fischer, Johannes; Herlez, Alexander. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
BASE
Show details
8
Faster Approximate Pattern Matching: A Unified Approach ...
BASE
Show details
9
Longest Unbordered Factor in Quasilinear Time
Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. : LIPIcs - Leibniz International Proceedings in Informatics. 29th International Symposium on Algorithms and Computation (ISAAC 2018), 2018
BASE
Show details
10
Longest Unbordered Factor in Quasilinear Time ...
Kociumaka, Tomasz; Kundu, Ritu; Mohamed, Manal. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2018
BASE
Show details
11
Longest Unbordered Factor in Quasilinear Time ...
BASE
Show details
12
Maximal Unbordered Factors of Random Strings ...
BASE
Show details
13
Efficient Index for Weighted Sequences
Barton, Carl; Kociumaka, Tomasz; Pissis, Solon P.. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
BASE
Show details
14
Minimal Suffix and Rotation of a Substring in Optimal Time
Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. : LIPIcs - Leibniz International Proceedings in Informatics. 27th Annual Symposium on Combinatorial Pattern Matching (CPM 2016), 2016
BASE
Show details
15
Minimal Suffix and Rotation of a Substring in Optimal Time ...
Kociumaka, Tomasz. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016
BASE
Show details
16
Sparse Suffix Tree Construction in Optimal Time and Space ...
BASE
Show details
17
Minimal Suffix and Rotation of a Substring in Optimal Time ...
Kociumaka, Tomasz. - : arXiv, 2016
BASE
Show details
18
Optimal Dynamic Strings ...
BASE
Show details
19
Wavelet Trees Meet Suffix Trees ...
BASE
Show details
20
Substring Suffix Selection ...
BASE
Show details

Page: 1 2

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
22
0
0
0
0
© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern