arXiv (OAI Expanded)
open access
Linear Probing with Non-Greedy Insertions
Linear probing hash tables classically use a \emph{greedy} insertion strategy, placing a key $u$ in the first available position out of $h(u), h(u) + 1, h(u) + 2, \ldots$. If the hash table is filled to $1 - 1/x$ full, this results in $Θ(x^{2})$ worst-case expected insertion time. In this paper, w
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
- Quadratic Probing Insertions Are $ε^{-(1+o(1))}$#792513
- Quadratic Probing Insertions Are $ε^{-(1+o(1))}$#788513
- The Power of Two-Choice Linear Probing#1155623
- Space-Efficient Lock-Free Linear-Probing Hash Table#282770
- Space/time trade-offs in hash coding with allowable errors#6541
Record · ID 1070881
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