| Publication | Date of Publication | Type |
|---|
Grammar boosting: a new technique for proving lower bounds for computation over compressed data
| 2024-11-28 | Paper |
An upper bound and linear-space queries on the LZ-End parsing
| 2024-07-19 | Paper |
Breaking the \(\mathcal{O}(n)\)-barrier in the construction of compressed suffix arrays and suffix trees
| 2024-05-14 | Paper |
Dynamic suffix array with polylogarithmic queries and updates
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
scientific article; zbMATH DE number 7740911 (Why is no real title available?)
| 2023-09-20 | Paper |
scientific article; zbMATH DE number 7378722 (Why is no real title available?)
| 2021-08-04 | Paper |
LZ-End Parsing in Linear Time
| 2020-05-27 | Paper |
String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing | 2020-01-30 | Paper |
Optimal construction of compressed indexes for highly repetitive texts
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Hybrid indexing revisited
2018 Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Engineering External Memory Induced Suffix Sorting
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Lempel-Ziv factorization: simple, fast, practical
2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
At the roots of dictionary compression: string attractors
Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing | 2019-08-22 | Paper |
Fixed block compression boosting in FM-indexes: theory and practice
Algorithmica | 2019-04-25 | Paper |
Better external memory LCP array construction
ACM Journal of Experimental Algorithmics | 2019-03-27 | Paper |
LCP array construction using \(O(\operatorname{sort}(n))\) (or less) I/Os
| 2018-10-17 | Paper |
Engineering external memory LCP array construction: parallel, in-place and large alphabet
| 2018-08-13 | Paper |
Diverse Palindromic Factorization is NP-Complete
International Journal of Foundations of Computer Science | 2018-05-15 | Paper |
scientific article; zbMATH DE number 6862137 (Why is no real title available?)
| 2018-04-19 | Paper |
Faster External Memory LCP Array Construction
| 2018-03-02 | Paper |
Engineering a lightweight external memory suffix array construction algorithm
Mathematics in Computer Science | 2017-07-17 | Paper |
Lazy Lempel-Ziv factorization algorithms
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
LCP array construction in external memory
ACM Journal of Experimental Algorithmics | 2017-06-16 | Paper |
Faster sparse suffix sorting
| 2017-03-03 | Paper |
Tighter bounds for the sum of irreducible LCP values
Theoretical Computer Science | 2017-02-06 | Paper |
Diverse Palindromic Factorization Is NP-complete
Developments in Language Theory | 2015-11-10 | Paper |
Parallel External Memory Suffix Sorting
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Tighter bounds for the sum of irreducible LCP values
Combinatorial Pattern Matching | 2015-08-20 | Paper |
A subquadratic algorithm for minimum palindromic factorization
Journal of Discrete Algorithms | 2014-09-05 | Paper |
String range matching
Combinatorial Pattern Matching | 2014-06-30 | Paper |
Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
Combinatorial Pattern Matching | 2013-06-14 | Paper |
