On risks of using cuckoo hashing with simple universal hash classes

zbMATH Open1421.68024MaRDI QIDQ4633892FDOQ4633892

Authors: Martin Dietzfelbinger, Ulf Schellbach 

Publication date: 6 May 2019

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

Recommendations

• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• Explicit and efficient hash families suffice for cuckoo hashing with a stash
• Cuckoo hashing: Further analysis
• Cuckoo hashing

Mathematics Subject Classification ID

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

Cited In (6)

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

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)