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''. All of our results come with matching lower bounds.

翻译：本文重新探讨数据结构中最基本的问题之一：将元素插入开放寻址哈希表，使得后续检索时探查次数尽可能少。我们证明，即使不随时间推移重排元素，也能构造出具有远超预期性能的哈希表——其期望搜索复杂度（包括均摊与最坏情况）优于以往认知。研究过程中，我们证伪了Yao在其开创性论文《均匀哈希的最优性》中提出的核心猜想。所有结果均配有相应的下界证明。