Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation

@article{Arbitman2010BackyardCH,
  title={Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation},
  author={Yuriy Arbitman and Moni Naor and Gil Segev},
  journal={2010 IEEE 51st Annual Symposium on Foundations of Computer Science},
  year={2010},
  pages={787-796}
}
The performance of a dynamic dictionary is measured mainly by its update time, lookup time, and space consumption. In terms of update time and lookup time there are known constructions that guarantee constant-time operations in the worst case with high probability, and in terms of space consumption there are known constructions that use essentially optimal space. However, although the first analysis of a dynamic dictionary dates back more than 45 years ago (when Knuth analyzed linear probing in… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 34 extracted citations

Malicious-Secure Private Set Intersection via Dual Execution

ACM Conference on Computer and Communications Security • 2017
View 3 Excerpts
Highly Influenced

Fast Private Set Intersection from Homomorphic Encryption

ACM Conference on Computer and Communications Security • 2017

Similar Papers

Loading similar papers…