Some Open Questions Related to Cuckoo Hashing

DOI10.1007/978-3-642-04128-0_1MaRDI QIDQ3639230zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Michael Mitzenmacher

Publication date 29 October 2009

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-04128-0_1

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• Cuckoo hashing: Further analysis
• Cuckoo hashing with pages
• Sharp load thresholds for cuckoo hashing
• On the insertion time of cuckoo hashing
• scientific article; zbMATH DE number 1875412

Cited in

(10)

• Dynamic space efficient hashing
• Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
• Sharp load thresholds for cuckoo hashing
• Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
• Dense peelable random uniform hypergraphs
• Dynamic space efficient hashing
• Load thresholds for cuckoo hashing with double hashing
• Privacy-preserving group data access via stateless oblivious RAM simulation
• DORAM revisited: maliciously secure RAM-MPC with logarithmic overhead
• Peeling close to the orientability threshold. Spatial coupling in hashing-based data structures

This page was built for publication: Some Open Questions Related to Cuckoo Hashing

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