e/Hopscotch hashing

Information
has gloss	eng: Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing. It is also well suited for implementing a concurrent hash table. Hopscotch hashing was introduced by Maurice Herlihy, Nir Shavit and Moran Tzafrir in 2008. The name is derived from the sequence of hops that characterize the table's insertion algorithm.
lexicalization	eng: hopscotch hashing
instance of	e/Search algorithm

Media
media:img	Hopscotch-wiki-example.gif