| Publication | Date of Publication | Type |
|---|
Sliding window string indexing in streams
| 2024-10-21 | Paper |
New advances in rightmost Lempel-Ziv
| 2024-05-29 | Paper |
Lyndon Words Accelerate Suffix Sorting.
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7700589 (Why is no real title available?)
| 2023-06-23 | Paper |
Deterministic Sparse Suffix Sorting in the Restore Model
ACM Transactions on Algorithms | 2023-04-26 | Paper |
Practical Performance of Space Efficient Data Structures for Longest Common Extensions.
| 2023-02-07 | Paper |
Practical Wavelet Tree Construction
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Engineering practical Lempel-Ziv tries
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Bidirectional Text Compression in External Memory
| 2022-05-11 | Paper |
Practical evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch tries
String Processing and Information Retrieval | 2021-02-16 | Paper |
Constructing the Wavelet Tree and Wavelet Matrix in Distributed Memory
2020 Proceedings of the Twenty-Second Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Lempel-Ziv Compression in a Sliding Window
| 2020-05-25 | Paper |
Lightweight distributed suffix array construction
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Simple, Fast and Lightweight Parallel Wavelet Tree Construction
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Inducing suffix and LCP arrays in external memory
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Engineering a Distributed Full-Text Index
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
High-order entropy compressed bit vectors with rank/select
Algorithms | 2019-03-26 | Paper |
Sparse text indexing in small space
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Compression with the tudocomp framework
| 2018-08-13 | Paper |
Lempel-Ziv-78 compressed string dictionaries
Algorithmica | 2018-07-25 | Paper |
Lempel-Ziv factorization powered by space efficient suffix trees
Algorithmica | 2018-07-25 | Paper |
On the Benefit of Merging Suffix Array Intervals for Parallel Pattern Matching
| 2017-10-17 | Paper |
Inducing suffix and LCP arrays in external memory
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Deterministic Sparse Suffix Sorting on Rewritable Texts
LATIN 2016: Theoretical Informatics | 2016-05-03 | Paper |
Approximating LZ77 via Small-Space Multiple-Pattern Matching
Algorithms - ESA 2015 | 2015-11-19 | Paper |
Alphabet-dependent string searching with wexponential search trees
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Lempel Ziv computation in small space (LZ-CISS)
Combinatorial Pattern Matching | 2015-08-20 | Paper |
On (dynamic) range minimum queries in external memory
Lecture Notes in Computer Science | 2013-08-12 | Paper |
Sparse suffix tree construction in small space
Automata, Languages, and Programming | 2013-08-06 | Paper |
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science | 2012-11-08 | Paper |
Forbidden patterns
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
Range median of minima queries, super-Cartesian trees, and text indexing
| 2011-12-19 | Paper |
Compact representation of posets
Algorithms and Computation | 2011-12-16 | Paper |
Inducing the LCP-array
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Space-efficient preprocessing schemes for range minimum queries on static arrays
SIAM Journal on Computing | 2011-07-29 | Paper |
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Combined data structure for previous- and next-smaller-values
Theoretical Computer Science | 2011-05-10 | Paper |
Finding range minima in the middle: approximations and applications
Mathematics in Computer Science | 2011-02-19 | Paper |
New common ancestor problems in trees and directed acyclic graphs
Information Processing Letters | 2010-09-07 | Paper |
Wee LCP
Information Processing Letters | 2010-09-07 | Paper |
Optimal succinctness for range minimum queries
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
Faster entropy-bounded compressed suffix trees
Theoretical Computer Science | 2009-11-18 | Paper |
Short Labels for Lowest Common Ancestors in Trees
Lecture Notes in Computer Science | 2009-10-29 | Paper |
A New Succinct Representation of RMQ-Information and Improvements in the Enhanced Suffix Array
Combinatorics, Algorithms, Probabilistic and Experimental Methodologies | 2009-03-03 | Paper |
Data structures for efficient string algorithms.
| 2008-08-20 | Paper |
Two-Dimensional Range Minimum Queries
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Suffix Arrays on Words
Combinatorial Pattern Matching | 2008-06-17 | Paper |
An(other) Entropy-Bounded Compressed Suffix Tree
Combinatorial Pattern Matching | 2008-06-17 | Paper |
Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
Combinatorial Pattern Matching | 2007-09-14 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
