SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
High-order entropy-compressed text indexes
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
When indexing equals compression: experiments with compressing suffix arrays and applications
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A linear lower bound on index size for text retrieval
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
New text indexing functionalities of the compressed suffix arrays
Journal of Algorithms
Implicit B-trees: a new data structure for the dictionary problem
Journal of Computer and System Sciences - Special issue on FOCS 2002
Dictionaries using variable-length keys and data, with applications
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
An optimal Bloom filter replacement
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Rank/select operations on large alphabets: a tool for text indexing
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Squeezing succinct data structures into entropy bounds
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
When indexing equals compression: Experiments with compressing suffix arrays and applications
ACM Transactions on Algorithms (TALG)
The cell probe complexity of succinct data structures
Theoretical Computer Science
Ultra-succinct representation of ordered 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)
Compact dictionaries for variable-length keys and data with applications
ACM Transactions on Algorithms (TALG)
On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices
CPM '08 Proceedings of the 19th annual symposium on Combinatorial Pattern Matching
On the Redundancy of Succinct Data Structures
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Monotone minimal perfect hashing: searching a sorted table with O(1) accesses
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Indexing internal memory with minimal perfect hash functions
SBBD '08 Proceedings of the 23rd Brazilian symposium on Databases
Bit-probe lower bounds for succinct data structures
Proceedings of the forty-first annual ACM symposium on Theory of computing
A Simple, Fast, and Compact Static Dictionary
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Optimal cache-oblivious implicit dictionaries
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Succinct representations of permutations
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Simple space-time trade-offs for AESA
WEA'07 Proceedings of the 6th international conference on Experimental algorithms
On the size of succinct indices
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Shorter implicit representation for planar graphs and bounded treewidth graphs
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Compact set representation for information retrieval
SPIRE'07 Proceedings of the 14th international conference on String processing and information retrieval
A locally encodable and decodable compressed data structure
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Note: On compact representations of All-Pairs-Shortest-Path-Distance matrices
Theoretical Computer Science
Cell-probe lower bounds for succinct partial sums
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Efficient set intersection for inverted indexing
ACM Transactions on Information Systems (TOIS)
Improved Compact Routing Tables for Planar Networks via Orderly Spanning Trees
SIAM Journal on Discrete Mathematics
Minimal perfect hashing: A competitive method for indexing internal memory
Information Sciences: an International Journal
A quick tour on suffix arrays and compressed suffix arrays
Theoretical Computer Science
Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
SIAM Journal on Computing
Ultra-succinct representation of ordered trees with applications
Journal of Computer and System Sciences
The complexity of implicit and space efficient priority queues
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
De dictionariis dynamicis pauco spatio utentibus
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Space-efficient multiple string matching automata
International Journal of Wireless and Mobile Computing
The Complexity of Distributions
SIAM Journal on Computing
Practical perfect hashing in nearly optimal space
Information Systems
Simple and space-efficient minimal perfect hash functions
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Succinct encoding of arbitrary graphs
Theoretical Computer Science
| Hi-index | 0.00 |
A static dictionary is a data structure storing subsets of a finite universe U, answering membership queries. We show that on a unit cost RAM with word size $\Theta(\log |U|)$, a static dictionary for n-element sets with constant worst case query time can be obtained using $B+O(\log\log |U|)+o(n)$ bits of storage, where $B=\ceiling{\log_2\binom{|U|}{n}}$ is the minimum number of bits needed to represent all n-element subsets of U.