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

Thirty years ago, the Robin Hood collision resolution strategy was introduced for open addressing hash tables, and a recurrence equation was found for the distribution of its search cost. Although this recurrence could not be solved analytically, it allowed for numerical computations that, remarkabl...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Combinatorics, probability & computing probability & computing, 2019-07, Vol.28 (4), p.600-617
Hauptverfasser:	POBLETE, P. V., VIOLA, A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Cost analysis Differential equations Hash based algorithms Search algorithms Variance
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!