Linear probing: The probable largest search time grows logarithmically with the number of records

DOI10.1016/0196-6774(87)90040-XMaRDI QIDQ4728255zbMATH OpenDBLPWikidataFDO

Authors Boris Pittel

Publication date 1987

Published in Journal of Algorithms (Search for Journal in Brave)

zbMATH Keywords

hashingworst-case performancelinear probing algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Hashing with Linear Probing under Nonuniform Probabilities
• Linear probing with constant independence
• Linear probing with 5-wise independence
• On probabilistic analysis of a coalesced hashing algorithm
• The expected length of the longest probe sequence for bucket searching when the distribution is not uniform

Cited in

(6)

• On the largest component of the random graph at a nearcritical stage
• Components of Random Forests
• Hashing with Linear Probing under Nonuniform Probabilities
• Parking with density
• Analysis of a drop-push model for percolation and coagulation
• Burning cars in a parking lot

This page was built for publication: Linear probing: The probable largest search time grows logarithmically with the number of records

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4728255)