On Worst Case Robin-Hood Hashing

We consider open addressing hashing, and implement it by using the Robin Hood strategy, that is, in case of collision, the element that has traveled the furthest can stay in the slot. We hash elements into a table of size n where each probe is independent and uniformly distributed over the table, an...

Description complète

Détails bibliographiques

Auteur principal:	Devroye, Luc (author)
Autres auteurs:	Morin, Pat (author), Viola, Alfredo (author)
Format:	report
Publié:	2002
Sujets:	OPEN ADRESSING HASHING ROBIN HOOD WORST-CASE SEARCH TIME COLLISION RESOLUTION PROBABILISTIC ANALYSIS OF ALGORITHMS
Accès en ligne:	http://hdl.handle.net/20.500.12008/3481
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!