Dominik Köppl

Affiliations:
  • Münster University, Germany
  • Tokyo Medical and Dental University, Japan
  • Kyushu University, Japan (former)


According to our database1, Dominik Köppl authored at least 70 papers between 2013 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data.
Bioinform., September, 2023

Longest bordered and periodic subsequences.
Inf. Process. Lett., August, 2023

Space-efficient Huffman codes revisited.
Inf. Process. Lett., 2023

Breaking a Barrier in Constructing Compact Indexes for Parameterized Pattern Matching.
CoRR, 2023

Acceleration of FM-Index Queries Through Prefix-Free Parsing.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

Space-Time Trade-Offs for the LCP Array of Wheeler DFAs.
Proceedings of the String Processing and Information Retrieval, 2023

Data Structures for SMEM-Finding in the PBWT.
Proceedings of the String Processing and Information Retrieval, 2023

Faster Block Tree Construction.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

Augmented Thresholds for MONI.
Proceedings of the Data Compression Conference, 2023

Encoding Hard String Problems with Answer Set Programming.
Proceedings of the 34th Annual Symposium on Combinatorial Pattern Matching, 2023

2022
Correction to: Graph Compression for Adjacency-Matrix Multiplication.
SN Comput. Sci., 2022

Graph Compression for Adjacency-Matrix Multiplication.
SN Comput. Sci., 2022

Improving Matrix-vector Multiplication via Lossless Grammar-Compressed Matrices.
Proc. VLDB Endow., 2022

Inferring Spatial Distance Rankings with Partial Knowledge on Routing Networks.
Inf., 2022

c-trie++: A dynamic trie tailored for fast prefix searches.
Inf. Comput., 2022

Longest (Sub-)Periodic Subsequence.
CoRR, 2022

Linking Off-Road Points to Routing Networks.
Algorithms, 2022

Fast and Simple Compact Hashing via Bucketing.
Algorithmica, 2022

Computing the Parameterized Burrows-Wheeler Transform Online.
Proceedings of the String Processing and Information Retrieval, 2022

Accessing the Suffix Array via φ <sup>-1</sup>-Forest.
Proceedings of the String Processing and Information Retrieval, 2022

Space-Efficient B Trees via Load-Balancing.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Computing Longest (Common) Lyndon Subsequences.
Proceedings of the Combinatorial Algorithms - 33rd International Workshop, 2022

Computing NP-Hard Repetitiveness Measures via MAX-SAT.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

HOLZ: High-Order Entropy Encoding of Lempel-Ziv Factor Distances.
Proceedings of the Data Compression Conference, 2022

Computing Lexicographic Parsings.
Proceedings of the Data Compression Conference, 2022

FM-Indexing Grammars Induced by Suffix Sorting for Long Patterns.
Proceedings of the Data Compression Conference, 2022

2021
Engineering Practical Lempel-Ziv Tries.
ACM J. Exp. Algorithmics, 2021

On Arithmetically Progressed Suffix Arrays and related Burrows-Wheeler Transforms.
CoRR, 2021

Load-Balancing Succinct B Trees.
CoRR, 2021

Re-Pair in Small Space.
Algorithms, 2021

Reversed Lempel-Ziv Factorization with Suffix Trees.
Algorithms, 2021

Non-Overlapping LZ77 Factorization and LZ78 Substring Compression Queries with Suffix Trees.
Algorithms, 2021

Extracting the Sparse Longest Common Prefix Array from the Suffix Binary Search Tree.
Proceedings of the String Processing and Information Retrieval, 2021

A Separation of γ and b via Thue-Morse Words.
Proceedings of the String Processing and Information Retrieval, 2021

Grammar Index by Induced Suffix Sorting.
Proceedings of the String Processing and Information Retrieval, 2021

PHONI: Streamed Matching Statistics with Multi-Genome References.
Proceedings of the 31st Data Compression Conference, 2021

Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time.
Proceedings of the 32nd Annual Symposium on Combinatorial Pattern Matching, 2021

2020
Space-efficient algorithms for computing minimal/shortest unique substrings.
Theor. Comput. Sci., 2020

Deterministic Sparse Suffix Sorting in the Restore Model.
ACM Trans. Algorithms, 2020

Dynamic Path-decomposed Tries.
ACM J. Exp. Algorithmics, 2020

Grammar-compressed Self-index with Lyndon Words.
CoRR, 2020

Computational Aspects of Ordered Integer Partitions with Bounds.
Algorithmica, 2020

On Arithmetically Progressed Suffix Arrays.
Proceedings of the Prague Stringology Conference 2020, Prague, Czech Republic, August 31, 2020

In-Place Bijective Burrows-Wheeler Transforms.
Proceedings of the 31st Annual Symposium on Combinatorial Pattern Matching, 2020

2019
Improved upper bounds on all maximal <i>α</i>-gapped repeats and palindromes.
Theor. Comput. Sci., 2019

Constructing the Bijective BWT.
CoRR, 2019

Re-Pair In-Place.
CoRR, 2019

Separate Chaining Meets Compact Hashing.
CoRR, 2019

Dynamic Packed Compact Tries Revisited.
CoRR, 2019

Compact Data Structures for Shortest Unique Substring Queries.
Proceedings of the String Processing and Information Retrieval, 2019

Bidirectional Text Compression in External Memory.
Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Indexing the Bijective BWT.
Proceedings of the 30th Annual Symposium on Combinatorial Pattern Matching, 2019

2018
Exploring regular structures in strings
PhD thesis, 2018

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., 2018

Improved Upper Bounds on all Maximal α-gapped Repeats and Palindromes.
CoRR, 2018

Lempel-Ziv Factorization Powered by Space Efficient Suffix Trees.
Algorithmica, 2018

2017
Compression with the tudocomp Framework.
Proceedings of the 16th International Symposium on Experimental Algorithms, 2017

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries.
Proceedings of the String Processing and Information Retrieval, 2017

Computing All Distinct Squares in Linear Time for Integer Alphabets.
Proceedings of the 28th Annual Symposium on Combinatorial Pattern Matching, 2017

2016
Efficiently Finding All Maximal alpha-gapped Repeats.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

Deterministic Sparse Suffix Sorting on Rewritable Texts.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Lempel-Ziv Computation in Compressed Space (LZ-CICS).
Proceedings of the 2016 Data Compression Conference, 2016

On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching.
Proceedings of the 27th Annual Symposium on Combinatorial Pattern Matching, 2016

2015
Efficiently Finding All Maximal $α$-gapped Repeats.
CoRR, 2015

Arithmetics on Suffix Arrays of Fibonacci Words.
Proceedings of the Combinatorics on Words - 10th International Conference, 2015

Lempel Ziv Computation in Small Space (LZ-CISS).
Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

Structured Document Algebra in Action.
Proceedings of the Software, 2015

2013
Computational Aspects of Ordered Integer Partition with Upper Bounds.
Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Interactive Toolbox for Spatial-Textual Preference Queries.
Proceedings of the Advances in Spatial and Temporal Databases, 2013

Breaking skyline computation down to the metal: the skyline breaker algorithm.
Proceedings of the 17th International Database Engineering & Applications Symposium, 2013


  Loading...