scholarly journals On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes

2009 ◽  
Author(s):  
Martin Dietzfelbinger ◽  
Ulf Schellbach
Keyword(s):  
Cuckoo Hashing

scholarly journals The Multiple-Orientability Thresholds for Random Hypergraphs

2015 ◽  
Vol 25 (6) ◽  
pp. 870-908 ◽  
Author(s):  
NIKOLAOS FOUNTOULAKIS ◽  
MEGHA KHOSLA ◽  
KONSTANTINOS PANAGIOTOU
Keyword(s):  
Load Balancing ◽  
Hard Disk ◽  
Maximum Load ◽  
Disk Arrays ◽  
Uniform Hypergraph ◽  
Cuckoo Hashing ◽  
Uniform Hypergraphs ◽  
Random Hypergraphs ◽  
Do So ◽  
Parallel Access

Ak-uniform hypergraphH= (V, E) is called ℓ-orientable if there is an assignment of each edgee∈Eto one of its verticesv∈esuch that no vertex is assigned more than ℓ edges. LetHn,m,kbe a hypergraph, drawn uniformly at random from the set of allk-uniform hypergraphs withnvertices andmedges. In this paper we establish the threshold for the ℓ-orientability ofHn,m,kfor allk⩾ 3 and ℓ ⩾ 2, that is, we determine a critical quantityc*k,ℓsuch that with probability 1 −o(1) the graphHn,cn,khas an ℓ-orientation ifc<c*k,ℓ, but fails to do so ifc>c*k,ℓ.Our result has various applications, including sharp load thresholds for cuckoo hashing, load balancing with guaranteed maximum load, and massive parallel access to hard disk arrays.

Cuckoo Hashing

2008 ◽  
pp. 212-215 ◽  
Author(s):  
Rasmus Pagh
Keyword(s):  
Cuckoo Hashing

scholarly journals Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash

Algorithmica ◽  
2013 ◽  
Vol 70 (3) ◽  
pp. 428-456 ◽  
Author(s):  
Martin Aumüller ◽  
Martin Dietzfelbinger ◽  
Philipp Woelfel
Keyword(s):  
Cuckoo Hashing

Cuckoo Hashing with Three Hash Tables

2020 ◽  
Vol 57 (8) ◽  
pp. 91-99
Author(s):  
Saeyoung Jang ◽  
Hayoung Byun ◽  
Hyesook Lim
Keyword(s):  
Hash Tables ◽  
Cuckoo Hashing

Cuckoo hashing: Further analysis

2003 ◽  
Vol 86 (4) ◽  
pp. 215-219 ◽  
Author(s):  
Luc Devroye ◽  
Pat Morin
Keyword(s):  
Cuckoo Hashing
Sign in / Sign up

Export Citation Format

Share Document