Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Linear Probing with Non-Greedy Insertions
Andrew Krapivin, William Kuszmaul, Yixuan Wang +1
Linear probing hash tables classically use a \emph{greedy} insertion strategy, placing a key in the first available position out of . If the h…
cs.DS2025
Optimal Bounds for Open Addressing Without Reordering
Martin Farach-Colton, Andrew Krapivin, William Kuszmaul
In this paper, we revisit one of the simplest problems in data structures: the task of inserting elements into an open-addressed hash table so that elements can later be retrieved…