Dominik Köppl
Dominik Köppl
M&D Data Science Center, Tokyo Medical and Dental University
確認したメール アドレス: tu-dortmund.de - ホームページ
タイトル
引用先
引用先
Computing all distinct squares in linear time for integer alphabets
H Bannai, S Inenaga, D Köppl
arXiv preprint arXiv:1610.03421, 2016
212016
Efficiently Finding All Maximal -gapped Repeats
P Gawrychowski, S Inenaga, D Köppl, F Manea
arXiv preprint arXiv:1509.09237, 2015
182015
Deterministic sparse suffix sorting on rewritable texts
J Fischer, I Tomohiro, D Köppl
LATIN 2016: Theoretical Informatics, 483-496, 2016
172016
Lempel Ziv Computation In Small Space (LZ-CISS)
J Fischer, I Tomohiro, D Köppl
Annual Symposium on Combinatorial Pattern Matching, 172-184, 2015
172015
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
162018
Compression with the tudocomp framework
P Dinklage, J Fischer, D Köppl, M Löbel, K Sadakane
arXiv preprint arXiv:1702.07577, 2017
152017
Lempel-Ziv computation in compressed space (LZ-CICS)
D Köppl, K Sadakane
2016 Data Compression Conference (DCC), 3-12, 2016
142016
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
132016
Lempel–Ziv Factorization Powered by Space Efficient Suffix Trees
J Fischer, I Tomohiro, D Köppl, K Sadakane
Algorithmica 80 (7), 2048-2081, 2018
122018
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
112015
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
82019
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
82017
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
72020
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
52020
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
52013
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
52013
c-trie++: A dynamic trie tailored for fast prefix searches
K Tsuruta, D Köppl, S Kanda, Y Nakashima, S Inenaga, H Bannai, ...
2020 Data Compression Conference (DCC), 243-252, 2020
42020
Improved upper bounds on all maximal α-gapped repeats and palindromes
I Tomohiro, D Köppl
Theoretical Computer Science 753, 1-15, 2019
42019
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
32019
Exploring regular structures in strings
D Köppl
32018
現在システムで処理を実行できません。しばらくしてからもう一度お試しください。
論文 1–20