scientific article

DOI10.4086/toc.2013.v009a030zbMath1297.68070OpenAlexW2407340388MaRDI QIDQ3191600

Kai-Min Chung, Michael Mitzenmacher, Salil P. Vadhan

Publication date: 6 October 2014

Published in: Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4086/toc.2013.v009a030

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

pairwise independencederandomizationhashingaverage caseextractorslinear probingBloom filtersbalanced allocations

Mathematics Subject Classification ID

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

Related Items (3)

HalftimeHash: modern hashing without 64-bit multipliers or finite fields ⋮ Engineering Practical Lempel-Ziv Tries ⋮ Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

Cites Work

• Network Applications of Bloom Filters: A Survey

This page was built for publication: