The analysis of closed hashing under limited randomness
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Practical minimal perfect hash functions for large databases
Communications of the ACM
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Exploiting storage redundancy to speed up randomized shared memory simulations
Theoretical Computer Science
A reliable randomized algorithm for the closest-pair problem
Journal of Algorithms
On the cell probe complexity of membership and perfect hashing
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Universal Hashing and k-Wise Independent Random Variables via Integer Arithmetic without Primes
STACS '96 Proceedings of the 13th 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
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions
Closed Hashing is Computable and Optimally Randomizable with Universal Hash Functions
On Universal Classes of Extremely Random Constant Time Hash Functions and their Time-space Tradeoff
On Universal Classes of Extremely Random Constant Time Hash Functions and their Time-space Tradeoff
Uniform hashing in constant time and linear space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Tabulation based 4-universal hashing with applications to second moment estimation
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Journal of Algorithms
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Asymmetric balanced allocation with simple hash functions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
History-Independent Cuckoo Hashing
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
More Robust Hashing: Cuckoo Hashing with a Stash
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
De-amortized Cuckoo Hashing: Provable Worst-Case Performance and Experimental Results
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Applications of a Splitting Trick
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing
The power of simple tabulation hashing
Proceedings of the forty-third annual ACM symposium on Theory of computing
Balanced allocation and dictionaries with tightly packed constant size bins
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
The Power of Simple Tabulation Hashing
Journal of the ACM (JACM)
Independence of tabulation-based hash classes
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
SIAM Journal on Computing
Practical perfect hashing in nearly optimal space
Information Systems
Explicit and efficient hash families suffice for cuckoo hashing with a stash
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Hardness preserving reductions via cuckoo hashing
TCC'13 Proceedings of the 10th theory of cryptography conference on Theory of Cryptography
| Hi-index | 0.01 |
We describe a simple randomized construction for generating pairs of hash functions h1,h2 from a universe U to ranges V = [m] = (0,1,...,m-1) and W = [m] so that for every key set S ⊆ U with n = |S| ≤ m/(1 + ε) the (random) bipartite (multi)graph with node set V ∪ W and edge set (h1(x),h2(x))| x ∈ S exhibits a structure that is essentially random. The construction combines d-wise independent classes for d a relatively small constant with the well-known technique of random offsets. While keeping the space needed to store the description of h1 and h2 at O(nζ), for ζ