Linear probing: The probable largest search time grows logarithmically with the number of records
From MaRDI portal
Publication:4728255
DOI10.1016/0196-6774(87)90040-XzbMath0618.68052WikidataQ61386872 ScholiaQ61386872MaRDI QIDQ4728255
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Related Items
Components of Random Forests, Analysis of a drop-push model for percolation and coagulation, Burning cars in a parking lot, Parking with density, Hashing with Linear Probing under Nonuniform Probabilities, On the largest component of the random graph at a nearcritical stage
