A defining feature of the linear-probing hash table is its spatial locality: at load factor $1 - \varepsilon$, the hash table can be implemented so that each operation scans a single contiguous region of expected size $O(1/\varepsilon)$ (this is known as the \emph{scan cost}). This guarantee, however, relies on all ite...
A. Conway, Hanna Komlós, William Kuszmaul· 0 citations
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
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
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.