On Worst-Case Robin Hood Hashing

DOI10.1137/S0097539702403372zbMath1082.68022OpenAlexW2061889429MaRDI QIDQ4651499

Pat Morin, Alfredo Viola, Luc P. Devroye

Publication date: 21 February 2005

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539702403372

zbMATH Keywords

probabilistic analysis of algorithmshashingopen addressingcollision resolutionworst-case search timeRobin Hood

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Combinatorial probability (60C05)

Related Items (2)

The Maximum Displacement for Linear Probing Hashing ⋮ Unnamed Item

This page was built for publication: On Worst-Case Robin Hood Hashing