| Publication | Date of Publication | Type |
|---|
| Compressibility measures and succinct data structures for piecewise linear approximations | 2026-10-01 | Paper |
| FL-RMQ: a learned approach to range minimum queries | 2026-07-17 | Paper |
| Static optimality theorem for external memory string access | 2026-05-29 | Paper |
| Opportunistic data structures with applications | 2026-05-08 | Paper |
| Overcoming the memory bottleneck in suffix tree construction | 2025-10-29 | Paper |
| Learned monotone minimal perfect hashing | 2025-01-06 | Paper |
Computational thinking. First algorithms, then code
Undergraduate Topics in Computer Science | 2024-11-08 | Paper |
| Engineering a textbook approach to index massive string dictionaries | 2024-05-29 | Paper |
| scientific article; zbMATH DE number 7788637 (Why is no real title available?) | 2024-01-15 | Paper |
A Learned Approach to Design Compressed Rank/Select Data Structures
ACM Transactions on Algorithms | 2023-10-31 | Paper |
Compressed string dictionaries via data-aware subtrie compaction
String Processing and Information Retrieval | 2023-08-04 | Paper |
On the performance of learned data structures
Theoretical Computer Science | 2021-06-08 | Paper |
A “Learned” Approach to Quicken and Compress Rank/Select Dictionaries
2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) | 2021-01-27 | Paper |
Linear time distributed swap edge algorithms
Information Processing Letters | 2020-08-04 | Paper |
Bicriteria data compression
SIAM Journal on Computing | 2019-11-08 | Paper |
Bicriteria data compression
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-06-20 | Paper |
| On the bit-complexity of Lempel-Ziv compression | 2019-05-06 | Paper |
Compressed cache-oblivious string B-tree
ACM Transactions on Algorithms | 2018-11-05 | Paper |
| Computational thinking. First algorithms, then code | 2018-10-12 | Paper |
| scientific article; zbMATH DE number 6876115 (Why is no real title available?) | 2018-05-29 | Paper |
On the parallel dynamic dictionary matching problem: new results with applications
Algorithms — ESA '96 | 2017-12-05 | Paper |
Multi-method dispatching: a geometric approach with applications to string matching problems
Proceedings of the thirty-first annual ACM symposium on Theory of Computing | 2016-09-29 | Paper |
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms | 2015-09-02 | Paper |
| Compression boosting in optimal linear time using the Burrows-Wheeler transform | 2015-08-03 | Paper |
Distribution-aware compressed full-text indexes
Algorithmica | 2015-03-23 | Paper |
| A simple storage scheme for strings achieving entropy bounds | 2014-12-18 | Paper |
Bicriteria data compression: efficient and usable
Lecture Notes in Computer Science | 2014-10-08 | Paper |
The compressed permuterm index
ACM Transactions on Algorithms | 2014-09-09 | Paper |
Compressed text indexes, from theory to practice
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
On the weak prefix-search problem
Theoretical Computer Science | 2014-01-09 | Paper |
On the bit-complexity of Lempel-Ziv compression
SIAM Journal on Computing | 2013-11-14 | Paper |
On the bit-complexity of Lempel-Ziv compression
SIAM Journal on Computing | 2013-11-14 | Paper |
Compressed Cache-Oblivious String B-tree
Lecture Notes in Computer Science | 2013-09-17 | Paper |
Lightweight data indexing and compression in external memory
Algorithmica | 2012-04-26 | Paper |
Distribution-aware compressed full-text indexes
Algorithms – ESA 2011 | 2011-09-16 | Paper |
On optimally partitioning a text to improve its compression
Algorithmica | 2011-08-16 | Paper |
On optimally partitioning a text to improve its compression
Algorithmica | 2011-08-16 | Paper |
On the weak prefix-search problem
Combinatorial Pattern Matching | 2011-06-29 | Paper |
On compact representations of all-pairs-shortest-path-distance matrices
Theoretical Computer Science | 2010-08-11 | Paper |
Lightweight data indexing and compression in external memory
LATIN 2010: Theoretical Informatics | 2010-04-27 | Paper |
On Optimally Partitioning a Text to Improve Its Compression
Lecture Notes in Computer Science | 2009-10-29 | Paper |
The myriad virtues of wavelet trees
Information and Computation | 2009-07-15 | Paper |
The Myriad Virtues of Wavelet Trees
Automata, Languages and Programming | 2009-03-12 | Paper |
Boosting textual compression in optimal linear time
Journal of the ACM | 2008-12-21 | Paper |
Indexing compressed text
Journal of the ACM | 2008-12-21 | Paper |
Suffix Arrays on Words
Combinatorial Pattern Matching | 2008-06-17 | Paper |
The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression
Lecture Notes in Computer Science | 2008-03-11 | Paper |
| scientific article; zbMATH DE number 5204525 (Why is no real title available?) | 2007-10-24 | Paper |
A simple storage scheme for strings achieving entropy bounds
Theoretical Computer Science | 2007-03-15 | Paper |
String Processing and Information Retrieval
Lecture Notes in Computer Science | 2006-10-24 | Paper |
Algorithms – ESA 2005
Lecture Notes in Computer Science | 2006-06-27 | Paper |
An experimental study of priority queues in external memory
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
RANDOMIZED EXTERNAL-MEMORY ALGORITHMS FOR LINE SEGMENT INTERSECTION AND OTHER GEOMETRIC PROBLEMS
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
The string B-tree
Journal of the ACM | 2005-01-25 | Paper |
Engineering a lightweight suffix array construction algorithm
Algorithmica | 2004-10-01 | Paper |
| scientific article; zbMATH DE number 1947433 (Why is no real title available?) | 2003-07-08 | Paper |
| An experimental study of an opportunistic index | 2003-01-14 | Paper |
A theoretical and experimental study on the construction of suffix arrays in external memory
Algorithmica | 2002-02-28 | Paper |
| scientific article; zbMATH DE number 1263248 (Why is no real title available?) | 2002-01-30 | Paper |
An experimental study of a compressed index
Information Sciences | 2001-10-10 | Paper |
| scientific article; zbMATH DE number 1559569 (Why is no real title available?) | 2001-02-28 | Paper |
| scientific article; zbMATH DE number 1424323 (Why is no real title available?) | 2000-06-07 | Paper |
Dynamic dictionary matching in external memory
Information and Computation | 2000-05-18 | Paper |
| scientific article; zbMATH DE number 1306892 (Why is no real title available?) | 2000-04-26 | Paper |
String search in coarse-grained parallel computers
Algorithmica | 2000-01-03 | Paper |
Improved Dynamic Text Indexing
Journal of Algorithms | 1999-05-11 | Paper |
On updating suffix tree labels
Theoretical Computer Science | 1998-08-13 | Paper |
Optimal On-Line Search and Sublinear Time Update in String Matching
SIAM Journal on Computing | 1998-05-10 | Paper |
Dynamic Text Indexing under String Updates
Journal of Algorithms | 1997-11-18 | Paper |
| scientific article; zbMATH DE number 871935 (Why is no real title available?) | 1996-12-11 | Paper |
| scientific article; zbMATH DE number 910911 (Why is no real title available?) | 1996-11-10 | Paper |
Static and dynamic parallel computation of connected components
Information Processing Letters | 1994-05-05 | Paper |
