On risks of using cuckoo hashing with simple universal hash classes

MaRDI QIDQ4633892zbMATH OpenFDO

Authors Martin Dietzfelbinger, Ulf Schellbach

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496857

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Recommendations

• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• Cuckoo hashing: Further analysis
• Cuckoo hashing

Cited in

(5)

• A faster algorithm for cuckoo insertion and bipartite matching in large graphs
• Tight thresholds for Cuckoo hashing via XORSAT (extended abstract)
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• Universal Hashing via Integer Arithmetic Without Primes, Revisited
• A caution on universal classes of hash functions

This page was built for publication: On risks of using cuckoo hashing with simple universal hash classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633892)