David Zuckerman

collaborators

2 papers

cs.DS2025

Linear Hashing Is Optimal

Michael Jaber, Vinayak M. Kumar, David Zuckerman

We prove that hashing $n$ balls into $n$ bins via a random matrix over $F_{2}$ yields expected maximum load $O (lo g n / lo g lo g n)$ . This matches the expected maximum load…

cs.CC2024

Improved Condensers for Chor-Goldreich Sources

Jesse Goodman, Xin Li, David Zuckerman

One of the earliest models of weak randomness is the Chor-Goldreich (CG) source. A $(t, n, k)$ -CG source is a sequence of random variables $X = (X_{1}, \dots, X_{t}) \sim ({0, 1}^{n})^{t}$ , where…