No. Title Author Year
1 Acceleration of FM-Index Queries Through Prefix-Free Parsing Hong, Aaron et al. 2023
2 Encoding Hard String Problems with Answer Set Programming Köppl, Dominik 2023
3 Faster Block Tree Construction Köppl, Dominik et al. 2023
4 Computing NP-Hard Repetitiveness Measures via MAX-SAT Bannai, Hideo et al. 2022
5 Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time Bannai, Hideo et al. 2021
6 Fast and Simple Compact Hashing via Bucketing Köppl, Dominik et al. 2020
7 In-Place Bijective Burrows-Wheeler Transforms Köppl, Dominik et al. 2020
8 Bidirectional Text Compression in External Memory Dinklage, Patrick et al. 2019
9 Indexing the Bijective BWT Bannai, Hideo et al. 2019
10 Compression with the tudocomp Framework Dinklage, Patrick et al. 2017
11 Computing All Distinct Squares in Linear Time for Integer Alphabets Bannai, Hideo et al. 2017
12 Efficiently Finding All Maximal alpha-gapped Repeats Gawrychowski, Pawel et al. 2016
13 On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching Fischer, Johannes et al. 2016
Current Page :
Number of result pages: 1
Number of documents: 13

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI