Article
Version 1
Preserved in Portico This version is not peer-reviewed
Two-way Linear Probing Revisited
Version 1
: Received: 6 October 2023 / Approved: 7 October 2023 / Online: 7 October 2023 (10:10:27 CEST)
A peer-reviewed article of this Preprint also exists.
Dalal, K.; Devroye, L.; Malalla, E. Two-Way Linear Probing Revisited. Algorithms 2023, 16, 500. Dalal, K.; Devroye, L.; Malalla, E. Two-Way Linear Probing Revisited. Algorithms 2023, 16, 500.
Abstract
We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.
Keywords
Open addressing hashing; linear probing; parking problem; worst-case search time; two-way chaining; multiple-choice paradigm; randomized algorithms; witness tree; probabilistic analysis
Subject
Computer Science and Mathematics, Data Structures, Algorithms and Complexity
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
