DE eng

Search in the Catalogues and Directories

Page: 1 2
Hits 1 – 20 of 25

1
Lyndon Words Accelerate Suffix Sorting ...
Bertram, Nico; Ellert, Jonas; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021
BASE
Show details
2
SACABench: Benchmarking Suffix Array Construction
In: ISSN: 0302-9743, 1611-3349 (2021)
BASE
Show details
3
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
In: ISSN: 1868-8969 (2021)
BASE
Show details
4
Contributions to speech and audio coding for single- and multi-device scenarios ; Beiträge zur Sprach- und Audiocodierung für Einzel- und Mehrgerätszenarien
BASE
Show details
5
LCP-Aware Parallel String Sorting ...
BASE
Show details
6
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
7
Space Efficient Construction of Lyndon Arrays in Linear Time ...
Bille, Philip; Ellert, Jonas; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2020
BASE
Show details
8
Parallel text index construction
BASE
Show details
9
Exploring regular structures in strings
Köppl, Dominik. - 2018
BASE
Show details
10
Lempel-Ziv Compression in a Sliding Window
Bille, Philip; Cording, Patrick Hagge; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2017. : LIPIcs - Leibniz International Proceedings in Informatics. 28th Annual Symposium on Combinatorial Pattern Matching (CPM 2017), 2017
BASE
Show details
11
Dismantling DivSufSort ...
BASE
Show details
12
Lempel-Ziv Compression in a Sliding Window ...
Bille, Philip; Cording, Patrick Hagge; Fischer, Johannes. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2017
BASE
Show details
13
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
Fischer, Johannes; Kurpicz, Florian. - : 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
Engineering a Distributed Full-Text Index ...
BASE
Show details
15
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching ...
BASE
Show details
16
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching ...
Fischer, Johannes; Köppl, Dominik; Kurpicz, Florian. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany, 2016
BASE
Show details
17
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching ...
Fischer, Johannes; Köppl, Dominik; Kurpicz, Florian. - : Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH (LZI), 2016
BASE
Show details
18
Deterministic Sparse Suffix Sorting in the Restore Model ...
BASE
Show details
19
Inducing Suffix and LCP Arrays in External Memory
BASE
Show details
20
Inducing Suffix and LCP Arrays in External Memory ...
BASE
Show details

Page: 1 2

Catalogues
1
1
1
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