Dominik Köppl

ORCID

Publication Activity (10 Years)

Years Active: 2013-2024
Publications (10 Years): 101

Top Venues

Publications

Dominik Köppl
Computing LZ78-Derivates with Suffix Trees. DCC (2024)
Eric M. Osterkamp, Dominik Köppl
Extending the Parameterized Burrows-Wheeler Transform. DCC (2024)
Akiyoshi Kawamoto, Tomohiro I, Dominik Köppl, Hideo Bannai
On the Hardness of Smallest RLSLPs and Collage Systems. DCC (2024)
Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Algorithms for Galois Words: Detection, Factorization, and Rotation. CPM (2024)
Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Algorithms for Galois Words: Detection, Factorization, and Rotation. CoRR (2024)
Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober
On arithmetically progressed suffix arrays and related Burrows-Wheeler transforms. Discret. Appl. Math. 355 (2024)
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)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing and indexing the bijective and extended Burrows-Wheeler transform. Inf. Comput. 297 (2024)
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
Edit and Alphabet-Ordering Sensitivity of Lex-Parse. MFCS (2024)
Hideo Bannai, Keisuke Goto, Shunsuke Kanda, Dominik Köppl
NP-Completeness for the Space-Optimality of Double-Array Tries. CoRR (2024)
Golnaz Badkobeh, Hideo Bannai, Dominik Köppl
Bijective BWT based compression schemes. CoRR (2024)
Yuto Nakashima, Dominik Köppl, Mitsuru Funakoshi, Shunsuke Inenaga, Hideo Bannai
Edit and Alphabet-Ordering Sensitivity of Lex-parse. CoRR (2024)
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
Pfp-fm: an accelerated FM-index. Algorithms Mol. Biol. 19 (1) (2024)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest Lyndon Subsequences and Longest Common Lyndon Subsequences. Algorithmica 86 (3) (2024)
Davide Cozzi, Massimiliano Rossi, Simone Rubinacci, Travis Gagie, Dominik Köppl, Christina Boucher, Paola Bonizzoni
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data. Bioinform. 39 (9) (2023)
Kento Iseri, Tomohiro I, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching. CoRR (2023)
Dominik Köppl
Encoding Hard String Problems with Answer Set Programming. CPM (2023)
Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza
Space-time Trade-offs for the LCP Array of Wheeler DFAs. CoRR (2023)
Dominik Köppl, Florian Kurpicz, Daniel Meyer
Faster Block Tree Construction. ESA (2023)
Paola Bonizzoni, Christina Boucher, Davide Cozzi, Travis Gagie, Dominik Köppl, Massimiliano Rossi
Data Structures for SMEM-Finding in the PBWT. SPIRE (2023)
Hideo Bannai, Tomohiro I, Dominik Köppl
Longest bordered and periodic subsequences. Inf. Process. Lett. 182 (2023)
César Martínez-Guardiola, Nathaniel K. Brown, Fernando Silva-Coira, Dominik Köppl, Travis Gagie, Susana Ladra
Augmented Thresholds for MONI. DCC (2023)
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
Acceleration of FM-index Queries Through Prefix-free Parsing. CoRR (2023)
Nicola Cotumaccio, Travis Gagie, Dominik Köppl, Nicola Prezza
Space-Time Trade-Offs for the LCP Array of Wheeler DFAs. SPIRE (2023)
Aaron Hong, Marco Oliva, Dominik Köppl, Hideo Bannai, Christina Boucher, Travis Gagie
Acceleration of FM-Index Queries Through Prefix-Free Parsing. WABI (2023)
Szymon Grabowski, Dominik Köppl
Space-efficient Huffman codes revisited. Inf. Process. Lett. 179 (2023)
César Martínez-Guardiola, Nathaniel K. Brown, Fernando Silva-Coira, Dominik Köppl, Travis Gagie, Susana Ladra
Augmented Thresholds for MONI. CoRR (2022)
Alexandre P. Francisco, Travis Gagie, Dominik Köppl, Susana Ladra, Gonzalo Navarro
Correction to: Graph Compression for Adjacency-Matrix Multiplication. SN Comput. Sci. 3 (3) (2022)
Tomohiro I, Dominik Köppl
Space-Efficient B Trees via Load-Balancing. IWOCA (2022)
Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Computing the Parameterized Burrows-Wheeler Transform Online. SPIRE (2022)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest (Common) Lyndon Subsequences. CoRR (2022)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-trie++: A dynamic trie tailored for fast prefix searches. Inf. Comput. 285 (Part) (2022)
Hideo Bannai, Tomohiro I, Dominik Köppl
Longest (Sub-)Periodic Subsequence. CoRR (2022)
Alexandre P. Francisco, Travis Gagie, Dominik Köppl, Susana Ladra, Gonzalo Navarro
Graph Compression for Adjacency-Matrix Multiplication. SN Comput. Sci. 3 (3) (2022)
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto
Computing NP-Hard Repetitiveness Measures via MAX-SAT. ESA (2022)
Dominik Köppl, Gonzalo Navarro, Nicola Prezza
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. DCC (2022)
Christina Boucher, Dominik Köppl, Herman Perera, Massimiliano Rossi
-Forest. SPIRE (2022)
Hideo Bannai, Keisuke Goto, Masakazu Ishihata, Shunsuke Kanda, Dominik Köppl, Takaaki Nishimoto
Computing NP-hard Repetitiveness Measures via MAX-SAT. CoRR (2022)
Dominik Köppl
Computing Lexicographic Parsings. DCC (2022)
Dominik Köppl
Linking Off-Road Points to Routing Networks. Algorithms 15 (5) (2022)
Dominik Köppl
Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks. Inf. 13 (4) (2022)
Paolo Ferragina, Travis Gagie, Dominik Köppl, Giovanni Manzini, Gonzalo Navarro, Manuel Striani, Francesco Tosoni
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. CoRR (2022)
Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. DCC (2022)
Dominik Köppl, Simon J. Puglisi, Rajeev Raman
Fast and Simple Compact Hashing via Bucketing. Algorithmica 84 (9) (2022)
Paolo Ferragina, Giovanni Manzini, Travis Gagie, Dominik Köppl, Gonzalo Navarro, Manuel Striani, Francesco Tosoni
Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices. Proc. VLDB Endow. 15 (10) (2022)
Daiki Hashimoto, Diptarama Hendrian, Dominik Köppl, Ryo Yoshinaka, Ayumi Shinohara
Computing the Parameterized Burrows-Wheeler Transform Online. CoRR (2022)
Hideo Bannai, Tomohiro I, Tomasz Kociumaka, Dominik Köppl, Simon J. Puglisi
Computing Longest (Common) Lyndon Subsequences. IWOCA (2022)
Dominik Köppl
Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees. Algorithms 14 (2) (2021)
Dominik Köppl, Gonzalo Navarro, Nicola Prezza
HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances. CoRR (2021)
Tomohiro I, Robert W. Irving, Dominik Köppl, Lorna Love
Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree. SPIRE (2021)
Dominik Köppl
Reversed Lempel-Ziv Factorization with Suffix Trees. Algorithms 14 (6) (2021)
Jin Jie Deng, Wing-Kai Hon, Dominik Köppl, Kunihiko Sadakane
FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns. CoRR (2021)
Szymon Grabowski, Dominik Köppl
Space-Efficient Huffman Codes Revisited. CoRR (2021)
Tomohiro I, Dominik Köppl
Load-Balancing Succinct B Trees. CoRR (2021)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. SPIRE (2021)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. CPM (2021)
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. DCC (2021)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair in Small Space. Algorithms 14 (1) (2021)
Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober
On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms. CoRR (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index By Induced Suffix Sorting. CoRR (2021)
Tooru Akagi, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar Index by Induced Suffix Sorting. SPIRE (2021)
Diego Arroyuelo, Rodrigo Cánovas, Johannes Fischer, Dominik Köppl, Marvin Löbel, Gonzalo Navarro, Rajeev Raman
Engineering Practical Lempel-Ziv Tries. ACM J. Exp. Algorithmics 26 (2021)
Hideo Bannai, Mitsuru Funakoshi, Tomohiro I, Dominik Köppl, Takuya Mieno, Takaaki Nishimoto
A Separation of γ and b via Thue-Morse Words. CoRR (2021)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair in Small Space. DCC (2020)
Jacqueline W. Daykin, Dominik Köppl, David Kübel, Florian Stober
On Arithmetically Progressed Suffix Arrays. Stringology (2020)
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara
In-Place Bijective Burrows-Wheeler Transforms. CoRR (2020)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Space-efficient algorithms for computing minimal/shortest unique substrings. Theor. Comput. Sci. 845 (2020)
Kazuya Tsuruta, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Grammar-compressed Self-index with Lyndon Words. CoRR (2020)
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 (2020)
Dominik Köppl, Daiki Hashimoto, Diptarama Hendrian, Ayumi Shinohara
In-Place Bijective Burrows-Wheeler Transforms. CPM (2020)
Dominik Köppl, Simon J. Puglisi, Rajeev Raman
Fast and Simple Compact Hashing via Bucketing. SEA (2020)
Roland Glück, Dominik Köppl
Computational Aspects of Ordered Integer Partitions with Bounds. Algorithmica 82 (10) (2020)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches. DCC (2020)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting in the Restore Model. ACM Trans. Algorithms 16 (4) (2020)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair in Small Space. Stringology (2020)
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa
Dynamic Path-decomposed Tries. ACM J. Exp. Algorithmics 25 (2020)
Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Dynamic Packed Compact Tries Revisited. CoRR (2019)
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
Bidirectional Text Compression in External Memory. CoRR (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. CoRR (2019)
Shunsuke Kanda, Dominik Köppl, Yasuo Tabei, Kazuhiro Morita, Masao Fuketa
Dynamic Path-Decomposed Tries. CoRR (2019)
Dominik Köppl
Separate Chaining Meets Compact Hashing. CoRR (2019)
Dominik Köppl, Tomohiro I, Isamu Furuya, Yoshimasa Takabatake, Kensuke Sakai, Keisuke Goto
Re-Pair In-Place. CoRR (2019)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Indexing the Bijective BWT. CPM (2019)
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski
Constructing the Bijective BWT. CoRR (2019)
Tomohiro I, Dominik Köppl
-gapped repeats and palindromes. Theor. Comput. Sci. 753 (2019)
Patrick Dinklage, Jonas Ellert, Johannes Fischer, Dominik Köppl, Manuel Penschuck
Bidirectional Text Compression in External Memory. ESA (2019)
Takuya Mieno, Dominik Köppl, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda
Compact Data Structures for Shortest Unique Substring Queries. SPIRE (2019)
Tomohiro I, Dominik Köppl
Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes. CoRR (2018)
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
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) (2018)
Johannes Fischer, Tomohiro I, Dominik Köppl, Kunihiko Sadakane
Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees. Algorithmica 80 (7) (2018)
Johannes Fischer, Dominik Köppl
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. SPIRE (2017)
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
Compression with the tudocomp Framework. SEA (2017)
Patrick Dinklage, Johannes Fischer, Dominik Köppl, Marvin Löbel, Kunihiko Sadakane
Compression with the tudocomp Framework. CoRR (2017)
Hideo Bannai, Shunsuke Inenaga, Dominik Köppl
Computing All Distinct Squares in Linear Time for Integer Alphabets. CPM (2017)
Johannes Fischer, Dominik Köppl
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries. CoRR (2017)
Johannes Fischer, Dominik Köppl, Florian Kurpicz
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CPM (2016)
Johannes Fischer, Tomohiro I, Dominik Köppl
Deterministic Sparse Suffix Sorting on Rewritable Texts. LATIN (2016)
Dominik Köppl, Kunihiko Sadakane
Lempel-Ziv Computation in Compressed Space (LZ-CICS). DCC (2016)
Pawel Gawrychowski, Tomohiro I, Shunsuke Inenaga, Dominik Köppl, Florin Manea
Efficiently Finding All Maximal alpha-gapped Repeats. STACS (2016)
Johannes Fischer, Dominik Köppl, Florian Kurpicz
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching. CoRR (2016)

Dominik Köppl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Dominik Köppl