scientific article; zbMATH DE number 5764819

MaRDI QIDQ3579408zbMATH OpenFDO

Authors Michael Mitzenmacher, Salil Vadhan

Publication date 6 August 2010

Mathematics Subject Classification ID

Data structures (68P05) Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20) Measures of information, entropy (94A17)

Cited in

(9)

• A faster algorithm for cuckoo insertion and bipartite matching in large graphs
• Binary vectors for fast distance and similarity estimation
• Minimal and monotone minimal perfect hash functions
• Sharp load thresholds for cuckoo hashing
• Maximum matchings in random bipartite graphs and the space utilization of cuckoo hash tables
• Weaknesses of Cuckoo Hashing with a Simple Universal Hash Class: The Case of Large Universes
• Simple, compact and robust approximate string dictionary
• Adaptive Cuckoo Filters
• Verifiable quantum advantage without structure

This page was built for publication:

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