Work

Optimal Bounds for Open Addressing Without Reordering

Year: 2024

Type: conference-paper

Abstract: 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 with as few probes as possible. We show that, even without reordering elements over time, it is possible to construct a hash table that achieves far better expected search complexities (both amortized and worst-case) than were previously thought possible. Along the way, we disprove the central conjecture left by Yao in his seminal paper “Uniform Hashing is Optimal”.

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/focs61266.2024.00045

Authors: Martín Farach-Colton, Andrew Krapivin, William Kuszmaul

Institutions: New York University, University of Cambridge, Carnegie Mellon University

Language: English

Topic: Algorithms and Data Compression

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: National Science Foundation

Awards: Foundations of Data Science Institute, NSF-BSF: Collaborative Research: AF: Small: Algorithmic Performance through History Independence, NSF-BSF: Collaborative Research: AF: Small: Algorithmic Performance through History Independence, Collaborative Research: AF: Medium: Adventures in Flatland: Algorithms for Modern Memories, Collaborative Research: AF: Medium: Adventures in Flatland: Algorithms for Modern Memories