Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Dynamic Perfect Hashing: Upper and Lower Bounds
SIAM Journal on Computing
Balanced allocations (extended abstract)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Expected Length of the Longest Probe Sequence in Hash Code Searching
Journal of the ACM (JACM)
SIAM Journal on Computing
Membership in Constant Time and Almost-Minimum Space
SIAM Journal on Computing
A New Universal Class of Hash Functions and Dynamic Hashing in Real Time
ICALP '90 Proceedings of the 17th International Colloquium on Automata, Languages and Programming
Polynomial Hash Functions Are Reliable (Extended Abstract)
ICALP '92 Proceedings of the 19th International Colloquium on Automata, Languages and Programming
Randomized Allocation Processes
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Studying Balanced Allocations with Differential Equations
Combinatorics, Probability and Computing
Efficient hashing with lookups in two memory accesses
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
More Robust Hashing: Cuckoo Hashing with a Stash
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
On risks of using cuckoo hashing with simple universal hash classes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
An Analysis of Random-Walk Cuckoo Hashing
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Real-time parallel hashing on the GPU
ACM SIGGRAPH Asia 2009 papers
Orientability of random hypergraphs and the power of multiple choices
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
More Robust Hashing: Cuckoo Hashing with a Stash
SIAM Journal on Computing
An Analysis of Random-Walk Cuckoo Hashing
SIAM Journal on Computing
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
Sharp load thresholds for cuckoo hashing
Random Structures & Algorithms
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Explicit and efficient hash families suffice for cuckoo hashing with a stash
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Enhancing lookup performance of key-value stores using cuckoo hashing
Proceedings of the 2013 Research in Adaptive and Convergent Systems
| Hi-index | 0.89 |
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O( n ) as long as the two open addressing tables are each of size at least (1 + ε) n , where ε 0 and n is the number of data points. Slightly improved bounds are obtained for various probabilities and constraints. The analysis rests on simple properties of branching processes.