Skip to content

Author

Michael A. Bender

We have 2 of 15 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Preprint Sep 2026

The Power of Two-Choice Linear Probing

This paper considers the following basic question: If an (ordered) linear-probing hash table is allowed \emph{two} hash functions, instead of one, how does this change the expected insertion and query time, as a function of the load factor $1 - \epsilon$? We prove that the \emph{greedy two-choice insertion strategy} ac...

Amir Azarmehr, Michael A. Bender, William Kuszmaul et al. · 0 citations
Preprint Aug 2026

Tight Bounds for Memory Allocation With and Without Request Fragmentation

This paper considers the following basic question: Does request fragmentation fundamentally change the problem of memory allocation, and if so, how, and finds that even using $k = 1 + o(1)$ request fragmentation, the optimal competitive ratiocollapses to $\Theta(\log M)$.

Michael A. Bender, A. Conway, Martín Farach-Colton et al. · 1 citation

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.