The following pages link to Dominik Köppl (Q724217):
Displaying 31 items.
- Lempel-Ziv factorization powered by space efficient suffix trees (Q724218) (← links)
- Improved upper bounds on all maximal \(\alpha\)-gapped repeats and palindromes (Q1625598) (← links)
- Tighter bounds and optimal algorithms for all maximal \(\alpha\)-gapped repeats and palindromes. Finding all maximal \(\alpha\)-gapped repeats and palindromes in optimal worst case time on integer alphabets (Q1702853) (← links)
- Computational aspects of ordered integer partitions with bounds (Q2006947) (← links)
- Space-efficient Huffman codes revisited (Q2094355) (← links)
- Grammar index by induced suffix sorting (Q2146128) (← links)
- Extracting the sparse longest common prefix array from the suffix binary search tree (Q2146135) (← links)
- A separation of \(\gamma\) and \(b\) via Thue-Morse words (Q2146136) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- Computing longest (common) Lyndon subsequences (Q2169947) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- Space-efficient algorithms for computing minimal/shortest unique substrings (Q2207510) (← links)
- c-trie++: a dynamic trie tailored for fast prefix searches (Q2672225) (← links)
- Deterministic Sparse Suffix Sorting on Rewritable Texts (Q2802962) (← links)
- Lempel Ziv Computation in Small Space (LZ-CISS) (Q2942255) (← links)
- Arithmetics on Suffix Arrays of Fibonacci Words (Q3449364) (← links)
- (Q4580160) (← links)
- Efficiently Finding All Maximal alpha-gapped Repeats (Q4601891) (← links)
- Bidirectional Text Compression in External Memory (Q5075783) (← links)
- Indexing the bijective BWT (Q5088907) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- (Q5110887) (← links)
- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Q5150931) (← links)
- Structured Document Algebra in Action (Q5256355) (← links)
- On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching (Q5369561) (← links)
- Deterministic Sparse Suffix Sorting in the Restore Model (Q5888941) (← links)
- (Q6098777) (← links)
- Computing longest Lyndon subsequences and longest common Lyndon subsequences (Q6119829) (← links)
- Longest bordered and periodic subsequences (Q6161459) (← links)
- Constructing and indexing the bijective and extended Burrows-Wheeler transform (Q6204171) (← links)
- Fast and simple compact hashing via bucketing (Q6487602) (← links)
