| Tight Upper And Lower Bounds On Suffix Tree Breadth | 0 | 0.34 | 2021 |
| Constructing the Bijective and the Extended Burrows-Wheeler Transform in Linear Time. | 0 | 0.34 | 2021 |
| Better External Memory LCP Array Construction. | 0 | 0.34 | 2019 |
| Indexing the Bijective BWT. | 0 | 0.34 | 2019 |
| Fixed Block Compression Boosting in FM-Indexes: Theory and Practice | 1 | 0.37 | 2019 |
| Diverse Palindromic Factorization Is Np-Complete | 5 | 0.60 | 2018 |
| Run Compressed Rank/Select for Large Alphabets | 1 | 0.35 | 2018 |
| Engineering External Memory Induced Suffix Sorting. | 4 | 0.42 | 2017 |
| Engineering a Lightweight External Memory Suffix Array Construction Algorithm. | 4 | 0.40 | 2017 |
| Document Retrieval on Repetitive String Collections. | 3 | 0.46 | 2017 |
| On Suffix Tree Breadth. | 0 | 0.34 | 2017 |
| On the Size of Lempel-Ziv and Lyndon Factorizations. | 0 | 0.34 | 2017 |
| Engineering External Memory LCP Array Construction: Parallel, In-Place and Large Alphabet. | 0 | 0.34 | 2017 |
| LCP Array Construction Using O(sort(n)) (or Less) I/Os. | 2 | 0.38 | 2016 |
| Lempel-Ziv Decoding in External Memory. | 1 | 0.36 | 2016 |
| V-Order: New combinatorial properties & a simple comparison algorithm. | 2 | 0.38 | 2016 |
| Linear-time String Indexing and Analysis in Small Space | 1 | 0.35 | 2016 |
| Faster, Minuter. | 0 | 0.34 | 2016 |
| Faster External Memory LCP Array Construction. | 5 | 0.43 | 2016 |
| Lazy Lempel-Ziv Factorization Algorithms. | 0 | 0.34 | 2016 |
| String Inference from the LCP Array. | 0 | 0.34 | 2016 |
| Tighter bounds for the sum of irreducible LCP values | 2 | 0.43 | 2015 |
| Parallel External Memory Suffix Sorting. | 8 | 0.47 | 2015 |
| Computing the Burrows-Wheeler transform in place and in small space | 2 | 0.39 | 2015 |
| Document Counting in Compressed Space | 3 | 0.39 | 2015 |
| Hybrid Compression of Bitvectors for the FM-Index | 15 | 0.72 | 2014 |
| A subquadratic algorithm for minimum palindromic factorization. | 12 | 0.99 | 2014 |
| Document Counting in Practice. | 0 | 0.34 | 2014 |
| Faster Sparse Suffix Sorting. | 4 | 0.42 | 2014 |
| LZ77-Based Self-indexing with Faster Pattern Matching. | 26 | 0.87 | 2014 |
| Queries on LZ-Bounded Encodings. | 14 | 0.79 | 2014 |
| LCP Array Construction in External Memory | 1 | 0.35 | 2014 |
| Lightweight Lempel-Ziv Parsing | 17 | 0.72 | 2013 |
| Versatile Succinct Representations of the Bidirectional Burrows-Wheeler Transform. | 19 | 0.70 | 2013 |
| A Constant-Space Comparison-Based Algorithm For Computing The Burrows-Wheeler Transform | 8 | 0.55 | 2013 |
| Lempel-Ziv Parsing in External Memory | 10 | 0.70 | 2013 |
| Colored range queries and document retrieval | 39 | 0.95 | 2013 |
| Near in Place Linear Time Minimum Redundancy Coding | 1 | 0.36 | 2013 |
| Linear Time Lempel-Ziv Factorization: Simple, Fast, Small | 19 | 1.11 | 2013 |
| Multi-pattern matching with bidirectional indexes | 4 | 0.42 | 2012 |
| A faster grammar-based self-index | 43 | 1.22 | 2012 |
| Indexed multi-pattern matching | 2 | 0.38 | 2012 |
| Grammar precompression speeds up burrows---wheeler compression | 1 | 0.36 | 2012 |
| Slashing the Time for BWT Inversion | 6 | 0.62 | 2012 |
| Fixed block compression boosting in FM-indexes | 19 | 0.79 | 2011 |
| Cache Friendly Burrows-Wheeler Inversion | 1 | 0.40 | 2011 |
| A Compressed Self-Index for Genomic Databases | 1 | 0.38 | 2011 |
| Pattern Kits | 0 | 0.34 | 2010 |
| Medium-space algorithms for inverse BWT | 6 | 0.52 | 2010 |
| Permuted Longest-Common-Prefix Array | 55 | 1.75 | 2009 |
