papers-we-love_papers-we-love/data_structures/README.md

# Data Structures

* [Dynamic Hash Tables](http://www.csd.uoc.gr/~hy460/pdf/Dynamic%20Hash%20Tables.pdf)
* [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.research.ibm.com/people/m/michael/podc-1996.pdf)
* [RRB-Trees: Efﬁcient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf)
* [Cuckoo Hashing](http://www.it-c.dk/people/pagh/papers/cuckoo-jour.pdf)
* [Fenwick Tree](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.8917&rep=rep1&type=pdf)
* [Hopscotch Hashing](http://mcg.cs.tau.ac.il/papers/disc2008-hopscotch.pdf)

## Hosted Papers

* :scroll: [Epidemic Broadcast Trees](epidemic-broadcast-trees.pdf)

* :scroll: [Ideal Hash Trees](ideal-hash-trees.pdf)

* :scroll: [The Least Common Ancestor Problem revisited](lca-revisited.pdf)

* :scroll: [The Level Ancestor Problem simplifed](level-ancestor-simplified.pdf)
Update to all READMEs for hosted content reorganization of so-called historical papers 2015-10-07 19:11:04 +00:00			`# Data Structures`

readme titles and readme URL approach 2014-03-14 02:39:39 +00:00			`* [Dynamic Hash Tables](http://www.csd.uoc.gr/~hy460/pdf/Dynamic%20Hash%20Tables.pdf)`
Fix typo 2014-03-20 22:10:49 +00:00			`* [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms](http://www.research.ibm.com/people/m/michael/podc-1996.pdf)`
Adding core.rrb-vector paper as well as createing a clojure cross reference README. 2014-04-02 14:09:21 +00:00			`* [RRB-Trees: Efﬁcient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf)`
add cuckoo hashing "Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup time." - https://en.wikipedia.org/wiki/Cuckoo_hashing this is related to #318 2015-08-20 20:40:31 +00:00			`* [Cuckoo Hashing](http://www.it-c.dk/people/pagh/papers/cuckoo-jour.pdf)`
A structure paper I come by every now and then. Useful for competitive programming. (#549) 2019-06-16 19:48:36 +00:00			`* [Fenwick Tree](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.14.8917&rep=rep1&type=pdf)`
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. 2015-08-27 16:17:37 +00:00			`* [Hopscotch Hashing](http://mcg.cs.tau.ac.il/papers/disc2008-hopscotch.pdf)`
Update to all READMEs for hosted content reorganization of so-called historical papers 2015-10-07 19:11:04 +00:00
			`## Hosted Papers`

			`* :scroll: [Epidemic Broadcast Trees](epidemic-broadcast-trees.pdf)`
Fix markup for data_structures 2015-11-28 17:26:36 +00:00
			`* :scroll: [Ideal Hash Trees](ideal-hash-trees.pdf)`

			`* :scroll: [The Least Common Ancestor Problem revisited](lca-revisited.pdf)`

			`* :scroll: [The Level Ancestor Problem simplifed](level-ancestor-simplified.pdf)`