Compact pat trees
Journal of Algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees and multisets
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science
Succinct static data structures
Succinct static data structures
Lower bounds on the size of selection and rank indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Rank and select revisited and extended
Theoretical Computer Science
On the Redundancy of Succinct Data Structures
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Information Processing Letters
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Optimal trade-offs for succinct string indexes
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Data structures: time, I/Os, entropy, joules!
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
Succinct indexes for strings, binary relations and multilabeled trees
ACM Transactions on Algorithms (TALG)
LRM-trees: compressed indices, adaptive sorting, and compressed permutations
CPM'11 Proceedings of the 22nd annual conference on Combinatorial pattern matching
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Optimal succinctness for range minimum queries
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Succinct representations of permutations and functions
Theoretical Computer Science
CPM'12 Proceedings of the 23rd Annual conference on Combinatorial Pattern Matching
LRM-Trees: Compressed indices, adaptive sorting, and compressed permutations
Theoretical Computer Science
New lower and upper bounds for representing sequences
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Colored range queries and document retrieval
Theoretical Computer Science
Succinct sampling from discrete distributions
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
On compressing permutations and adaptive sorting
Theoretical Computer Science
Compact binary relation representations with rich functionality
Information and Computation
Journal of Discrete Algorithms
| Hi-index | 5.23 |
After a general description of the Burrows-Wheeler transform and a brief survey of recent work on processing its output, the paper examines the coding of the zero-runs from the MTF recoding stage, an aspect with little prior treatment. It is concluded ...