Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > MICHAEL JABER:
All reports by Author Michael Jaber:

TR25-064 | 20th May 2025
Michael Jaber, Vinayak Kumar, David Zuckerman

Linear Hashing Is Optimal

We prove that hashing $n$ balls into $n$ bins via a random matrix over $GF(2)$ yields expected maximum load $O(\log n / \log \log n)$. This matches the expected maximum load of a fully random function and resolves an open question posed by Alon, Dietzfelbinger, Miltersen, Petrank, and Tardos (STOC ... more >>>


TR25-047 | 10th April 2025
Michael Jaber, Yang P. Liu, Shachar Lovett, Anthony Ostuni, Mehtaab Sawhney

Quasipolynomial bounds for the corners theorem

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G \setminus \{0\}$ such that $(x, y)$, $(x+d, y)$, $(x, y+d) \in A$. We prove that
$|A| \le |G|^2 ... more >>>




ISSN 1433-8092 | Imprint