Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Short encodings of planar graphs and maps
Discrete Applied Mathematics
Separators for sphere-packings and nearest neighbor graphs
Journal of the ACM (JACM)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
List processing in real time on a serial computer
Communications of the ACM
Geometry and topology for mesh generation
Geometry and topology for mesh generation
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
Low Redundancy in Static Dictionaries with Constant Query Time
SIAM Journal on Computing
A Fast General Methodology for Information-Theoretically Optimal Encodings of Graphs
SIAM Journal on Computing
Space-efficient finger search on degree-balanced search trees
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Compact representations of separable graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Compact Encodings of Planar Graphs via Canonical Orderings and Multiple Parentheses
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Space Efficient Hash Tables with Worst Case Constant Access Time
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Succinct representation of balanced parentheses, static trees and planar graphs
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Compact representations of ordered sets
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct dynamic dictionaries and trees
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Engineering a compact parallel delaunay algorithm in 3D
Proceedings of the twenty-second annual symposium on Computational geometry
Compressed data structures: Dictionaries and data-aware measures
Theoretical Computer Science
On compressing the textual web
Proceedings of the third ACM international conference on Web search and data mining
| Hi-index | 0.00 |
We consider the problem of maintaining a dynamic dictionary in which both the keys and the associated data are variable-length bit-strings. We present a dictionary structure based on hashing that supports constant time lookup and expected amortized constant time insertion and deletion. To store the key-data pairs (s1, t1) ... (sn, tn), our dictionary structure uses O(m) bits where m = Σ(max(|si| -- log n, 1) + |ti| and |si| is the length of bit string si. We assume a word length w log m.We present several applications, including representations for semi-dynamic graphs, ordered sets for integers in a bounded range, cardinal trees with varying cardinality, and simplicial meshes of k dimensions. These results either generalize or simplify previous results.