Balls and Bins: Smaller Hash Families and Faster Evaluation

DOI10.1109/FOCS.2011.49zbMATH Open1292.68040OpenAlexW1981326337MaRDI QIDQ5494989FDOQ5494989

Authors: L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wieder 

Publication date: 30 July 2014

Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/focs.2011.49

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Data structures (68P05) Searching and sorting (68P10)

Cited In (3)

• The Power of Filling in Balanced Allocations
• Public-coin statistical zero-knowledge batch verification against malicious verifiers
• Power of \(d\) choices with simple tabulation

This page was built for publication: Balls and Bins: Smaller Hash Families and Faster Evaluation

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