No. Title Author Year
1 Computing NP-Hard Repetitiveness Measures via MAX-SAT Bannai, Hideo et al. 2022
2 Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time Bannai, Hideo et al. 2021
3 Fast and Simple Compact Hashing via Bucketing Köppl, Dominik et al. 2020
4 In-Place Bijective Burrows-Wheeler Transforms Köppl, Dominik et al. 2020
5 Bidirectional Text Compression in External Memory Dinklage, Patrick et al. 2019
6 Indexing the Bijective BWT Bannai, Hideo et al. 2019
7 Compression with the tudocomp Framework Dinklage, Patrick et al. 2017
8 Computing All Distinct Squares in Linear Time for Integer Alphabets Bannai, Hideo et al. 2017
9 Efficiently Finding All Maximal alpha-gapped Repeats Gawrychowski, Pawel et al. 2016
10 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: 10

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