You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
# 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: 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 )
## 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