The expected length of the longest probe sequence for bucket searching when the distribution is not uniform

DOI10.1016/0196-6774(85)90015-XMaRDI QIDQ3687729zbMATH OpenOpenAlexFDO

Authors Luc Devroye

Publication date 1985

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

Full work available at URL https://doi.org/10.1016/0196-6774(85)90015-x

zbMATH Keywords

separate chainingcollision resolutionhashing file

Mathematics Subject Classification ID

Searching and sorting (68P10)

Recommendations

• Hashing with Linear Probing under Nonuniform Probabilities
• On probabilistic analysis of a coalesced hashing algorithm
• Asymptotic distribution for the cost of linear probing hashing
• The cost distribution of clustering in random probing
• The analysis of double hashing

Cited in

(12)

• Hashing with Linear Probing under Nonuniform Probabilities
• Two-way chaining for non-uniform distributions
• The maximum displacement for linear probing hashing
• Analytical depoissonization and its applications
• Linear hashing is awesome
• Linear probing: The probable largest search time grows logarithmically with the number of records
• Laws of large numbers and tail inequalities for random tries and PATRICIA trees
• scientific article; zbMATH DE number 3902020 (Why is no real title available?)
• On the expected longest length probe sequence for hashing with separate chaining
• Parking with density
• Search performance of double-linked coalesced hashing can not exceed bucketing
• Cuckoo hashing: Further analysis

This page was built for publication: The expected length of the longest probe sequence for bucket searching when the distribution is not uniform

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