| Publication | Date of Publication | Type |
|---|
Grammar Compression by Induced Suffix Sorting
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Computing Burrows-Wheeler similarity distributions for string collections
String Processing and Information Retrieval | 2023-07-28 | Paper |
Construction of Fundamental Data Structures for Strings
SpringerBriefs in Computer Science | 2021-08-11 | Paper |
Fast construction of compressed web graphs
String Processing and Information Retrieval | 2021-02-16 | Paper |
Fast and Lightweight LCP-Array Construction Algorithms
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Fast and Lightweight LCP-Array Construction Algorithms
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
CSA++: Fast Pattern Search for Large Alphabets
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Improved single-term top-\(k\) document retrieval
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Elias-Fano meets single-term top-\(k\) document retrieval
2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Fixed block compression boosting in FM-indexes: theory and practice
Algorithmica | 2019-04-25 | Paper |
| Parallel computation for the all-pairs suffix-prefix problem | 2018-10-17 | Paper |
| Practical range minimum queries revisited | 2018-08-13 | Paper |
| The quantile index -- succinct self-index for top-\(k\) document retrieval | 2018-08-13 | Paper |
Practical compact indexes for top-\(k\) document retrieval
ACM Journal of Experimental Algorithmics | 2017-07-03 | Paper |
Inducing enhanced suffix arrays for string collections
Theoretical Computer Science | 2017-05-15 | Paper |
String search experimentation using massive data
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2017-01-13 | Paper |
Optimal suffix sorting and LCP array construction for constant alphabets
Information Processing Letters | 2016-11-23 | Paper |
An improved algorithm for the all-pairs suffix-prefix problem
Journal of Discrete Algorithms | 2016-07-15 | Paper |
Compact indexes for flexible top-\(k\)
Combinatorial Pattern Matching | 2015-08-20 | Paper |
Improved and extended locating functionality on compressed suffix arrays
Journal of Discrete Algorithms | 2015-05-04 | Paper |
Compressed suffix trees, efficient computation and storage of LCP-values
ACM Journal of Experimental Algorithmics | 2015-03-16 | Paper |
Relative Lempel-Ziv with constant-time random access
String Processing and Information Retrieval | 2015-02-10 | Paper |
Multi-pattern matching with bidirectional indexes
Journal of Discrete Algorithms | 2014-08-13 | Paper |
Computing the longest common prefix array based on the Burrows-Wheeler transform
Journal of Discrete Algorithms | 2013-06-24 | Paper |
Multi-pattern matching with bidirectional indexes
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
Information and Computation | 2012-05-24 | Paper |
Lempel-Ziv Factorization Revisited
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
Information Processing Letters | 2010-09-02 | Paper |
Bidirectional search in a string with wavelet trees
Combinatorial Pattern Matching | 2010-07-26 | Paper |
A Compressed Enhanced Suffix Array Supporting Fast String Matching
String Processing and Information Retrieval | 2009-09-29 | Paper |
