scientific article
From MaRDI portal
Publication:3579408
zbMath1192.68202MaRDI QIDQ3579408
Michael Mitzenmacher, Salil P. Vadhan
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Measures of information, entropy (94A17) Data structures (68P05) Randomized algorithms (68W20)
Related Items (10)
Binary vectors for fast distance and similarity estimation ⋮ Sharp load thresholds for cuckoo hashing ⋮ Maximum matchings in random bipartite graphs and the space utilization of Cuckoo Hash tables ⋮ External-memory multimaps ⋮ Minimal and Monotone Minimal Perfect Hash Functions ⋮ Simple, compact and robust approximate string dictionary ⋮ 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 faster algorithm for cuckoo insertion and bipartite matching in large graphs ⋮ Adaptive Cuckoo Filters
This page was built for publication:
