Author

Martín Farach-Colton

1 paper indexed here

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