Low Redundancy in Static Dictionaries with Constant Query Time
SIAM Journal on Computing
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 16th Conference on Foundations of Software Technology and Theoretical Computer Science
Lower bounds on the size of selection and rank indexes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
SIAM Journal on Computing
Structuring labeled trees for optimal succinctness, and beyond
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Representing Trees of Higher Degree
Algorithmica
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Time-space trade-offs for predecessor search
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Succinct ordinal trees with level-ancestor queries
ACM Transactions on Algorithms (TALG)
Note: A simple storage scheme for strings achieving entropy bounds
Theoretical Computer Science
Compressed representations of sequences and full-text indexes
ACM Transactions on Algorithms (TALG)
The cell probe complexity of succinct data structures
Theoretical Computer Science
Succinct indexes for strings, binary relations and multi-labeled trees
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets
ACM Transactions on Algorithms (TALG)
Optimal lower bounds for rank and select indexes
Theoretical Computer Science
EDBT '08 Proceedings of the 11th international conference on Extending database technology: Advances in database technology
Space-efficient static trees and graphs
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
On the size of succinct indices
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
New lower and upper bounds for representing sequences
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Improved grammar-based compressed indexes
SPIRE'12 Proceedings of the 19th international conference on String Processing and Information Retrieval
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
| Hi-index | 0.00 |
The redundancyof a succinct data structure is the difference between the space it uses and the appropriate information-theoretic lower bound. We consider the problem of representing binary sequences and strings succinctly using small redundancy. We improve the redundancy required to support the important operations of rankand selectefficiently for binary sequences and for strings over small alphabets. We also show optimal density-sensitiveupper and lower bounds on the redundancy for systematicencodings of binary sequences.