default search action
Dominik Köppl
Person information
- affiliation: University of Yamanashi, Kofu, Japan
- affiliation (former): Münster University, Germany
- affiliation (former): Tokyo Medical and Dental University, Japan
- affiliation (former): Kyushu University, Japan
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j25]Hideo Bannai
, Tomohiro I
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86(3): 735-756 (2024) - [j24]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Pfp-fm: an accelerated FM-index. Algorithms Mol. Biol. 19(1): 15 (2024) - [j23]Jacqueline W. Daykin, Dominik Köppl
On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms. Discret. Appl. Math. 355: 180-199 (2024) - [j22]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297: 105153 (2024) - [c49]Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Algorithms for Galois Words: Detection, Factorization, and Rotation. CPM 2024: 18:1-18:16 - [c48]Dominik Köppl:
Computing LZ78-Derivates with Suffix Trees. DCC 2024: 133-142 - [c47]Eric M. Osterkamp, Dominik Köppl:
Extending the Parameterized Burrows-Wheeler Transform. DCC 2024: 143-152 - [c46]Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai:
On the Hardness of Smallest RLSLPs and Collage Systems. DCC 2024: 243-252 - [c45]Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. ICALP 2024: 89:1-89:19 - [c44]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS 2024: 75:1-75:15 - [c43]Golnaz Badkobeh
Bijective BWT Based Compression Schemes. SPIRE 2024: 16-25 - [c42]Hiroki Shibata
LZ78 Substring Compression with CDAWGs. SPIRE 2024: 289-305 - [i40]Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai:
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR abs/2402.19223 (2024) - [i39]Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara:
Algorithms for Galois Words: Detection, Factorization, and Rotation. CoRR abs/2403.02636 (2024) - [i38]Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl:
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR abs/2403.04951 (2024) - [i37]Golnaz Badkobeh, Hideo Bannai, Dominik Köppl:
Bijective BWT based compression schemes. CoRR abs/2406.16475 (2024) - [i36]Dominik Köppl:
Substring Compression Variations and LZ78-Derivates. CoRR abs/2409.14649 (2024) - 2023
- [j21]Davide Cozzi
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data. Bioinform. 39(9) (2023) - [j20]Szymon Grabowski
Space-efficient Huffman codes revisited. Inf. Process. Lett. 179: 106274 (2023) - [j19]Hideo Bannai, Tomohiro I, Dominik Köppl
Longest bordered and periodic subsequences. Inf. Process. Lett. 182: 106398 (2023) - [c41]Dominik Köppl
Encoding Hard String Problems with Answer Set Programming. CPM 2023: 17:1-17:21 - [c40]César Martínez-Guardiola
Augmented Thresholds for MONI. DCC 2023: 268-277 - [c39]Dominik Köppl
Faster Block Tree Construction. ESA 2023: 74:1-74:20 - [c38]Paola Bonizzoni
Data Structures for SMEM-Finding in the PBWT. SPIRE 2023: 89-101 - [c37]Nicola Cotumaccio
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE 2023: 143-156 - [c36]Aaron Hong, Marco Oliva, Dominik Köppl
Acceleration of FM-Index Queries Through Prefix-Free Parsing. WABI 2023: 13:1-13:16 - [i35]Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie:
Acceleration of FM-index Queries Through Prefix-free Parsing. CoRR abs/2305.05893 (2023) - [i34]Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza:
Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR abs/2306.05684 (2023) - [i33]Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. CoRR abs/2308.05977 (2023) - 2022
- [j18]Dominik Köppl
Fast and Simple Compact Hashing via Bucketing. Algorithmica 84(9): 2735-2766 (2022) - [j17]Dominik Köppl
Linking Off-Road Points to Routing Networks. Algorithms 15(5): 163 (2022) - [j16]Kazuya Tsuruta, Dominik Köppl
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285(Part): 104794 (2022) - [j15]Dominik Köppl
Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks. Inf. 13(4): 168 (2022) - [j14]Paolo Ferragina, Giovanni Manzini, Travis Gagie, Dominik Köppl
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. Proc. VLDB Endow. 15(10): 2175-2187 (2022) - [j13]Alexandre P. Francisco
Graph Compression for Adjacency-Matrix Multiplication. SN Comput. Sci. 3(3): 193 (2022) - [j12]Alexandre P. Francisco
Correction to: Graph Compression for Adjacency-Matrix Multiplication. SN Comput. Sci. 3(3): 228 (2022) - [c35]Jin Jie Deng, Wing-Kai Hon, Dominik Köppl
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. DCC 2022: 63-72 - [c34]Dominik Köppl
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. DCC 2022: 83-92 - [c33]Dominik Köppl
Computing Lexicographic Parsings. DCC 2022: 232-241 - [c32]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA 2022: 12:1-12:16 - [c31]Hideo Bannai
Computing Longest (Common) Lyndon Subsequences. IWOCA 2022: 128-142 - [c30]Tomohiro I
Space-Efficient B Trees via Load-Balancing. IWOCA 2022: 327-340 - [c29]Daiki Hashimoto, Diptarama Hendrian
Computing the Parameterized Burrows-Wheeler Transform Online. SPIRE 2022: 70-85 - [c28]Christina Boucher, Dominik Köppl
Accessing the Suffix Array via φ -1-Forest. SPIRE 2022: 86-98 - [i32]Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi:
Computing Longest (Common) Lyndon Subsequences. CoRR abs/2201.06773 (2022) - [i31]Hideo Bannai, Tomohiro I, Dominik Köppl:
Longest (Sub-)Periodic Subsequence. CoRR abs/2202.07189 (2022) - [i30]Paolo Ferragina, Travis Gagie, Dominik Köppl
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. CoRR abs/2203.14540 (2022) - [i29]Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl
Computing the Parameterized Burrows-Wheeler Transform Online. CoRR abs/2206.15100 (2022) - [i28]Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR abs/2207.02571 (2022) - [i27]César Martínez-Guardiola, Nathaniel K. Brown, Fernando Silva-Coira, Dominik Köppl
Augmented Thresholds for MONI. CoRR abs/2211.07794 (2022) - 2021
- [j11]Dominik Köppl
Re-Pair in Small Space. Algorithms 14(1): 5 (2021) - [j10]Dominik Köppl
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees. Algorithms 14(2): 44 (2021) - [j9]Dominik Köppl
Reversed Lempel-Ziv Factorization with Suffix Trees. Algorithms 14(6): 161 (2021) - [j8]Diego Arroyuelo
Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics 26: 14:1-14:47 (2021) - [c27]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM 2021: 7:1-7:16 - [c26]Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl
PHONI: Streamed Matching Statistics with Multi-Genome References. DCC 2021: 193-202 - [c25]Tooru Akagi, Dominik Köppl
Grammar Index by Induced Suffix Sorting. SPIRE 2021: 85-99 - [c24]Tomohiro I
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. SPIRE 2021: 143-150 - [c23]Hideo Bannai
A Separation of γ and b via Thue-Morse Words. SPIRE 2021: 167-178 - [i26]Tomohiro I, Dominik Köppl:
Load-Balancing Succinct B Trees. CoRR abs/2104.08751 (2021) - [i25]Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto:
A Separation of γ and b via Thue-Morse Words. CoRR abs/2104.09985 (2021) - [i24]Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar Index By Induced Suffix Sorting. CoRR abs/2105.13744 (2021) - [i23]Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober:
On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms. CoRR abs/2107.02503 (2021) - [i22]Szymon Grabowski, Dominik Köppl:
Space-Efficient Huffman Codes Revisited. CoRR abs/2108.05495 (2021) - [i21]Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane:
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. CoRR abs/2110.01181 (2021) - [i20]Dominik Köppl, Gonzalo Navarro, Nicola Prezza:
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. CoRR abs/2111.02478 (2021) - 2020
- [j7]Roland Glück
Computational Aspects of Ordered Integer Partitions with Bounds. Algorithmica 82(10): 2955-2984 (2020) - [j6]Shunsuke Kanda
Dynamic Path-decomposed Tries. ACM J. Exp. Algorithmics 25: 1-28 (2020) - [j5]Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms 16(4): 50:1-50:53 (2020) - [j4]Takuya Mieno
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845: 230-242 (2020) - [c22]Dominik Köppl
In-Place Bijective Burrows-Wheeler Transforms. CPM 2020: 21:1-21:15 - [c21]Kazuya Tsuruta, Dominik Köppl
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC 2020: 243-252 - [c20]Dominik Köppl
Re-Pair in Small Space. DCC 2020: 377 - [c19]Jacqueline W. Daykin, Dominik Köppl
On Arithmetically Progressed Suffix Arrays. Stringology 2020: 96-110 - [c18]Dominik Köppl
Re-Pair in Small Space. Stringology 2020: 134-147 - [c17]Dominik Köppl
Fast and Simple Compact Hashing via Bucketing. SEA 2020: 7:1-7:14 - [i19]Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Grammar-compressed Self-index with Lyndon Words. CoRR abs/2004.05309 (2020) - [i18]Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara:
In-Place Bijective Burrows-Wheeler Transforms. CoRR abs/2004.12590 (2020) - [i17]Christina Boucher, Travis Gagie, Tomohiro I, Dominik Köppl, Ben Langmead, Giovanni Manzini, Gonzalo Navarro, Alejandro Pacheco, Massimiliano Rossi:
PHONI: Streamed Matching Statistics with Multi-Genome References. CoRR abs/2011.05610 (2020)
2010 – 2019
- 2019
- [j3]Tomohiro I, Dominik Köppl
Improved upper bounds on all maximal α-gapped repeats and palindromes. Theor. Comput. Sci. 753: 1-15 (2019) - [c16]Hideo Bannai
Indexing the Bijective BWT. CPM 2019: 17:1-17:14 - [c15]Patrick Dinklage
Bidirectional Text Compression in External Memory. ESA 2019: 41:1-41:16 - [c14]Takuya Mieno
Compact Data Structures for Shortest Unique Substring Queries. SPIRE 2019: 107-123 - [i16]Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Dynamic Packed Compact Tries Revisited. CoRR abs/1904.07467 (2019) - [i15]Dominik Köppl:
Separate Chaining Meets Compact Hashing. CoRR abs/1905.00163 (2019) - [i14]Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Compact Data Structures for Shortest Unique Substring Queries. CoRR abs/1905.12854 (2019) - [i13]Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa:
Dynamic Path-Decomposed Tries. CoRR abs/1906.06015 (2019) - [i12]Patrick Dinklage, Jonas Ellert
Bidirectional Text Compression in External Memory. CoRR abs/1907.03235 (2019) - [i11]Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto:
Re-Pair In-Place. CoRR abs/1908.04933 (2019) - [i10]Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Constructing the Bijective BWT. CoRR abs/1911.06985 (2019) - 2018
- [b1]Dominik Köppl
Exploring regular structures in strings. Dortmund University, Germany, 2018 - [j2]Johannes Fischer, Tomohiro I, Dominik Köppl
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80(7): 2048-2081 (2018) - [j1]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl
Tighter Bounds and Optimal Algorithms for All Maximal α-gapped Repeats and Palindromes - Finding All Maximal α-gapped Repeats and Palindromes in Optimal Worst Case Time on Integer Alphabets. Theory Comput. Syst. 62(1): 162-191 (2018) - [i9]Tomohiro I, Dominik Köppl:
Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes. CoRR abs/1802.10355 (2018) - 2017
- [c13]Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM 2017: 22:1-22:18 - [c12]Johannes Fischer, Dominik Köppl
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. SPIRE 2017: 191-207 - [c11]Patrick Dinklage
Compression with the tudocomp Framework. SEA 2017: 13:1-13:22 - [i8]Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane:
Compression with the tudocomp Framework. CoRR abs/1702.07577 (2017) - [i7]Johannes Fischer, Dominik Köppl:
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. CoRR abs/1706.03035 (2017) - 2016
- [c10]Johannes Fischer, Dominik Köppl
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CPM 2016: 26:1-26:11 - [c9]Dominik Köppl
Lempel-Ziv Computation in Compressed Space (LZ-CICS). DCC 2016: 3-12 - [c8]Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. LATIN 2016: 483-496 - [c7]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl
Efficiently Finding All Maximal alpha-gapped Repeats. STACS 2016: 39:1-39:14 - [i6]Johannes Fischer, Dominik Köppl, Florian Kurpicz:
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CoRR abs/1606.02465 (2016) - [i5]Hideo Bannai, Shunsuke Inenaga, Dominik Köppl:
Computing All Distinct Squares in Linear Time for Integer Alphabets. CoRR abs/1610.03421 (2016) - 2015
- [c6]Don S. Batory, Peter Höfner, Dominik Köppl
Structured Document Algebra in Action. Software, Services, and Systems 2015: 291-311 - [c5]Johannes Fischer, Tomohiro I, Dominik Köppl
Lempel Ziv Computation in Small Space (LZ-CISS). CPM 2015: 172-184 - [c4]Dominik Köppl
Arithmetics on Suffix Arrays of Fibonacci Words. WORDS 2015: 135-146 - [i4]Johannes Fischer, Tomohiro I, Dominik Köppl:
Lempel Ziv Computation In Small Space (LZ-CISS). CoRR abs/1504.02605 (2015) - [i3]Johannes Fischer, Tomohiro I, Dominik Köppl:
Deterministic Sparse Suffix Sorting on Rewritable Texts. CoRR abs/1509.07417 (2015) - [i2]Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea:
Efficiently Finding All Maximal $α$-gapped Repeats. CoRR abs/1509.09237 (2015) - [i1]Dominik Köppl, Kunihiko Sadakane:
Lempel Ziv Computation In Compressed Space (LZ-CICS). CoRR abs/1510.02882 (2015) - 2013
- [c3]Dominik Köppl
Breaking skyline computation down to the metal: the skyline breaker algorithm. IDEAS 2013: 132-141 - [c2]Florian Wenzel, Dominik Köppl
Interactive Toolbox for Spatial-Textual Preference Queries. SSTD 2013: 462-466 - [c1]Roland Glück
Computational Aspects of Ordered Integer Partition with Upper Bounds. SEA 2013: 79-90
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-14 00:57 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: