Balls and Bins: Smaller Hash Families and Faster Evaluation

DOI10.1137/120871626zbMath1275.68075OpenAlexW2086383825MaRDI QIDQ2848208

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

Publication date: 25 September 2013

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/120871626

zbMATH Keywords

pseudorandom generatorshash functionsballs and bins

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40)

Related Items (6)

Pseudorandomness via the Discrete Fourier Transform ⋮ Balanced allocation on hypergraphs ⋮ Paradigms for Unconditional Pseudorandom Generators ⋮ Explicit correlation amplifiers for finding outlier correlations in deterministic subquadratic time ⋮ Balanced allocation on dynamic hypergraphs ⋮ Congested Clique Algorithms for Graph Spanners

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