Archives/papers-we-love_papers-we-love
1
0
Fork 0
mirror of https://github.com/papers-we-love/papers-we-love.git synced 2024-10-27 20:34:20 +00:00
Code Issues Projects Releases Wiki Activity

Hopscotch hashing

Browse Source 
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.
This commit is contained in:
Kevin Mulvey 2015-08-27 12:17:37 -04:00
parent b044936102
commit a596b6a0ce
1 changed files with 1 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
data_structures/README.md
View File

@ -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)