From a596b6a0ceb10f3699c482ce2cab7a5dcb758444 Mon Sep 17 00:00:00 2001 From: Kevin Mulvey Date: Thu, 27 Aug 2015 12:17:37 -0400 Subject: [PATCH] Hopscotch hashing Introduced by Maurice Herlihy, Nir Shavit and Moran Tzafrir in 2008, hopscotch is a way of resolving hash collisions using open addressing and is also useful in implementing a concurrent hash table. --- data_structures/README.md | 1 + 1 file changed, 1 insertion(+) diff --git a/data_structures/README.md b/data_structures/README.md index 9829f5a..58e51e2 100644 --- a/data_structures/README.md +++ b/data_structures/README.md @@ -2,3 +2,4 @@ * [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.research.ibm.com/people/m/michael/podc-1996.pdf) * [RRB-Trees: Efficient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf) * [Cuckoo Hashing](http://www.it-c.dk/people/pagh/papers/cuckoo-jour.pdf) +* [Hopscotch Hashing](http://mcg.cs.tau.ac.il/papers/disc2008-hopscotch.pdf)