SIAM Journal on Computing
Cuckoo hashing: further analysis
Information Processing Letters
How asymmetry helps load balancing
Journal of the ACM (JACM)
Journal of Algorithms
Cores in random hypergraphs and Boolean formulas
Random Structures & Algorithms
The cores of random hypergraphs with a given degree sequence
Random Structures & Algorithms
A phase transition for avoiding a giant component
Random Structures & Algorithms
Balanced allocation and dictionaries with tightly packed constant size bins
Theoretical Computer Science
The k-orientability thresholds for Gn, p
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Why simple hash functions work: exploiting the entropy in a data stream
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Succinct Data Structures for Retrieval and Approximate Membership (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On risks of using cuckoo hashing with simple universal hash classes
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete 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
Tight thresholds for cuckoo hashing via XORSAT
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Orientability of random hypergraphs and the power of multiple choices
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An Analysis of Random-Walk Cuckoo Hashing
SIAM Journal on Computing
A precise analysis of Cuckoo hashing
ACM Transactions on Algorithms (TALG)
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables
Random Structures & Algorithms
Hi-index | 0.00 |
The paradigm of many choices has influenced significantly the design of efficient data structures and, most notably, hash tables. Cuckoo hashing is a technique that extends this concept. There, we are given a table with n locations, and we assume that each location can hold one item. Each item to be inserted chooses randomly k ≥ 2 locations and has to be placed in any one of them. How much load can cuckoo hashing handle before collisions prevent the successful assignment of the available items to the chosen locations? Practical evaluations and theoretical analysis of this method have shown that one can allocate a number of elements that is a large proportion of the size of the table, being very close to 1 even for small values of k such as 4 or 5. In this paper we show that there is a critical value for this proportion: with high probability, when the amount of available items is below this value, then these can be allocated successfully, but when it exceeds this value, the allocation becomes impossible. We give explicitly for each k ≥ 3 this critical value. This answers an open question posed by Mitzenmacher (ESA '09) and underpins theoretically the experimental results. Our proofs are based on the translation of the question into a hypergraph setting, and the study of the related typical properties of random k -uniform hypergraphs.© 2012 Wiley Periodicals, Inc. Random Struct., 2012 (Supported by a fellowship from Alexander von Humboldt Foundation.)