Lempel–Ziv factorization powered by space efficient suffix trees J Fischer, T I, D Köppl, K Sadakane
Algorithmica 80, 2048-2081, 2018
29 2018 Computing all distinct squares in linear time for integer alphabets H Bannai, S Inenaga, D Köppl
arXiv preprint arXiv:1610.03421, 2016
28 2016 Tighter Bounds and Optimal Algorithms for All Maximal α -gapped Repeats and Palindromes: Finding All Maximal α -gapped Repeats and Palindromes in Optimal … P Gawrychowski, T I, S Inenaga, D Köppl, F Manea
Theory of Computing Systems 62, 162-191, 2018
25 2018 Lempel-Ziv computation in compressed space (LZ-CICS) D Köppl, K Sadakane
2016 Data Compression Conference (DCC), 3-12, 2016
25 2016 Efficiently Finding All Maximal P Gawrychowski, S Inenaga, D Köppl, F Manea
arXiv preprint arXiv:1509.09237, 2015
24 2015 Lempel Ziv computation in small space (LZ-CISS) J Fischer, T I, D Köppl
Combinatorial Pattern Matching: 26th Annual Symposium, CPM 2015, Ischia …, 2015
24 2015 PHONI: Streamed matching statistics with multi-genome references C Boucher, T Gagie, I Tomohiro, D Köppl, B Langmead, G Manzini, ...
2021 Data Compression Conference (DCC), 193-202, 2021
22 2021 Compression with the tudocomp framework P Dinklage, J Fischer, D Köppl, M Löbel, K Sadakane
arXiv preprint arXiv:1702.07577, 2017
21 2017 Indexing the bijective BWT H Bannai, J Kärkkäinen, D Köppl, M Piatkowski
30th Annual Symposium on Combinatorial Pattern Matching (CPM 2019), 17: 1-17: 14, 2019
18 2019 On the benefit of merging suffix array intervals for parallel pattern matching J Fischer, D Köppl, F Kurpicz
arXiv preprint arXiv:1606.02465, 2016
18 2016 Deterministic sparse suffix sorting on rewritable texts J Fischer, T I, D Köppl
LATIN 2016: Theoretical Informatics: 12th Latin American Symposium, Ensenada …, 2016
17 2016 c-trie++: A dynamic trie tailored for fast prefix searches K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ...
Information and Computation 285, 104794, 2022
16 2022 Grammar-compressed self-index with Lyndon words K Tsuruta, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda
arXiv preprint arXiv:2004.05309, 2020
14 2020 Improving matrix-vector multiplication via lossless grammar-compressed matrices P Ferragina, T Gagie, D Köppl, G Manzini, G Navarro, M Striani, F Tosoni
arXiv preprint arXiv:2203.14540, 2022
13 2022 Constructing the bijective and the extended Burrows-Wheeler transform in linear time H Bannai, J Kärkkäinen, D Köppl, M Picatkowski
arXiv preprint arXiv:1911.06985, 2019
12 2019 Non-overlapping LZ77 factorization and LZ78 substring compression queries with suffix trees D Köppl
Algorithms 14 (2), 44, 2021
11 2021 Structured document algebra in action D Batory, P Höfner, D Köppl, B Möller, A Zelend
Software, Services, and Systems: Essays Dedicated to Martin Wirsing on the …, 2015
11 2015 Dynamic path-decomposed tries S Kanda, D Köppl, Y Tabei, K Morita, M Fuketa
Journal of Experimental Algorithmics (JEA) 25, 1-28, 2020
10 2020 Deterministic sparse suffix sorting in the restore model J Fischer, T I, D Köppl
ACM Transactions on Algorithms (TALG) 16 (4), 1-53, 2020
10 2020 In-place bijective burrows-wheeler transforms D Köppl, D Hashimoto, D Hendrian, A Shinohara
arXiv preprint arXiv:2004.12590, 2020
10 2020 