On probabilistic analysis of a coalesced hashing algorithm

DOI10.1214/AOP/1176992090zbMath0626.60012OpenAlexW1972189084MaRDI QIDQ580811

Boris G. Pittel

Publication date: 1987

Published in: The Annals of Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aop/1176992090

zbMATH Keywords

sequential searchallocation modelhashing algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Limit theorems in probability theory (60F99)

Related Items (1)

Analysis of Robin Hood and Other Hashing Algorithms Under the Random Probing Model, With and Without Deletions

This page was built for publication: On probabilistic analysis of a coalesced hashing algorithm