arXiv (All)
open access
The Power of Two-Choice Linear Probing
This paper considers the following basic question: If an (ordered) linear-probing hash table is allowed \emph{two} hash functions, instead of one, how does this change the expected insertion and query time, as a function of the load factor $1 - ε$? We prove that the \emph{greedy two-choice insertion
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Linear Probing with Non-Greedy Insertions#1070881
- Space-Efficient Lock-Free Linear-Probing Hash Table#282770
- Quadratic Probing Insertions Are $ε^{-(1+o(1))}$#792513
- Quadratic Probing Insertions Are $ε^{-(1+o(1))}$#788513
- Noisy Quantum Query Complexity via Fractional Block Sensitivity#1155441
Record · ID 1155623
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive