Efficiently Finding All Maximal -gapped Repeats P Gawrychowski, S Inenaga, D Köppl, F Manea
arXiv preprint arXiv:1509.09237, 2015
18 2015 Lempel Ziv Computation In Small Space (LZ-CISS) J Fischer, I Tomohiro, D Köppl
Annual Symposium on Combinatorial Pattern Matching, 172-184, 2015
17 2015 Computing all distinct squares in linear time for integer alphabets H Bannai, S Inenaga, D Köppl
arXiv preprint arXiv:1610.03421, 2016
16 2016 Deterministic sparse suffix sorting on rewritable texts J Fischer, I Tomohiro, D Köppl
LATIN 2016: Theoretical Informatics, 483-496, 2016
16 2016 Tighter bounds and optimal algorithms for all maximal α-gapped repeats and palindromes P Gawrychowski, I Tomohiro, S Inenaga, D Köppl, F Manea
Theory of Computing Systems 62 (1), 162-191, 2018
15 2018 Lempel-Ziv computation in compressed space (LZ-CICS) D Köppl, K Sadakane
2016 Data Compression Conference (DCC), 3-12, 2016
14 2016 Compression with the tudocomp framework P Dinklage, J Fischer, D Köppl, M Löbel, K Sadakane
arXiv preprint arXiv:1702.07577, 2017
12 2017 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
12 2016 Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees J Fischer, I Tomohiro, D Köppl, K Sadakane
Algorithmica 80 (7), 2048-2081, 2018
11 2018 Structured document algebra in action D Batory, P Höfner, D Köppl, B Möller, A Zelend
Software, Services, and Systems, 291-311, 2015
11 2015 Practical evaluation of lempel-Ziv-78 and lempel-ziv-welch tries J Fischer, D Köppl
International Symposium on String Processing and Information Retrieval, 191-207, 2017
7 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), 2019
5 2019 Interactive toolbox for spatial-textual preference queries F Wenzel, D Köppl, W Kießling
International Symposium on Spatial and Temporal Databases, 462-466, 2013
5 2013 Computational aspects of ordered integer partition with upper bounds R Glück, D Köppl, G Wirsching
International Symposium on Experimental Algorithms, 79-90, 2013
5 2013 Compact Data Structures for Shortest Unique Substring Queries T Mieno, D Köppl, Y Nakashima, S Inenaga, H Bannai, M Takeda
International Symposium on String Processing and Information Retrieval, 107-123, 2019
3 2019 Dynamic packed compact tries revisited K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ...
arXiv preprint arXiv:1904.07467, 2019
3 2019 Improved upper bounds on all maximal α-gapped repeats and palindromes I Tomohiro, D Köppl
Theoretical Computer Science 753, 1-15, 2019
3 2019 Pseudodifferentialoperatoren mit nichtglatten Koeffizienten auf Mannigfaltigkeiten D Köppl
arXiv preprint arXiv:1311.1834, 2013
3 2013 Separate chaining meets compact hashing D Köppl
arXiv preprint arXiv:1905.00163, 2019
2 2019 Arithmetics on Suffix Arrays of Fibonacci Words D Köppl, I Tomohiro
International Conference on Combinatorics on Words, 135-146, 2015
2 2015