Cuckoo hashing

Known as: Cuckoo (disambiguation), Cuckoo hash, Cuckoo hash table 
Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2014
Highly Cited
2014
Fast concurrent hash tables are an increasingly important building block as we scale systems to greater numbers of cores and… (More)
Is this relevant?
2014
2014
This paper presents a lock-free cuckoo hashing algorithm, to the best of our knowledge this is the first lock-free cuckoo hashing… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
Is this relevant?
Highly Cited
2014
Highly Cited
2014
In many networking systems, Bloom filters are used for high-speed set membership tests. They permit a small fraction of false… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2013
2013
Cuckoo hashing is an efficient technique for creating large hash tables with high space utilization and guaranteed constant… (More)
  • table 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Abstract. We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n… (More)
  • figure 1
  • figure 4
  • figure 2
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We present a new class of resizable sequential and concurrent hash map algorithms directed at both uni-processor and multicore… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Cuckoo hashing is an efficient and practical dynamic dictionary. It provides expected amortized constant update time, worst case… (More)
Is this relevant?
2006
2006
HAL is a multi-disciplinary open access archive for the deposit and dissemination of scientific research documents, whether they… (More)
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We present a simple dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2003
2003
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table… (More)
Is this relevant?