Author

Hanna Komlós

h-index 4 View on Semantic Scholar

We have 2 of 14 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 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

Preprint Aug 2026

Lower Bounds for Linear Hashing via Arithmetic Kakeya

It is shown that, for sufficiently large $p, the expected maximum loads in the modular and real settings are essentially the same, giving an alternative route to an $n^{1/3+o(1)}$ upper bound, and the Kakeya conjecture for upper Minkowski dimension is proved.

Ainesh Bakshi, A. Conway, Hanna Komlós et al. · 1 citation