| Publication | Date of Publication | Type |
|---|
| An optimal algorithm to find champions of tournament graphs | 2024-04-19 | Paper |
| A new linear-time algorithm for centroid decomposition | 2024-04-19 | Paper |
| Compressed Weighted de Bruijn Graphs | 2023-06-14 | Paper |
| TSXor: a simple time series compression algorithm | 2022-06-15 | Paper |
Adaptive learning of compressible strings
Theoretical Computer Science | 2021-11-18 | Paper |
An encoding for order-preserving matching
(available as arXiv preprint) | 2020-05-27 | Paper |
| Dynamic Elias-Fano representation | 2020-05-25 | 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 |
Compressed static functions with applications
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-05-15 | 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 |
Compressed string dictionary search with edit distance one
Algorithmica | 2016-04-06 | Paper |
Space-efficient substring occurrence estimation
Algorithmica | 2016-03-23 | 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 |
Compressed data structures for strings. On searching and extracting strings from compressed textual data
Atlantis Studies in Computing | 2013-12-06 | 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 |
Dynamic Compressed Strings with Random Access
Automata, Languages, and Programming | 2013-08-06 | Paper |
Compressed string dictionary look-up with edit distance one
Combinatorial Pattern Matching | 2012-08-14 | 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 compact representations of all-pairs-shortest-path-distance matrices
Theoretical Computer Science | 2010-08-11 | Paper |
On Optimally Partitioning a Text to Improve Its Compression
Lecture Notes in Computer Science | 2009-10-29 | Paper |
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
Combinatorial Pattern Matching | 2008-06-17 | Paper |
A simple storage scheme for strings achieving entropy bounds
Theoretical Computer Science | 2007-03-15 | Paper |
