Balls and Bins: Smaller Hash Families and Faster Evaluation

DOI10.1109/FOCS.2011.49zbMath1292.68040OpenAlexW1981326337MaRDI QIDQ5494989

L. Elisa Celis, Gil Segev, Omer Reingold, 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

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

Related Items

Unnamed Item ⋮ The Power of Filling in Balanced Allocations ⋮ Public-coin statistical zero-knowledge batch verification against malicious verifiers