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.
19 lines
950 B
19 lines
950 B
# 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](https://www.cs.rochester.edu/u/scott/papers/1996_PODC_queues.pdf)
|
|
* [RRB-Trees: Efficient Immutable Vectors](http://infoscience.epfl.ch/record/169879/files/RMTrees.pdf)
|
|
* [Cuckoo Hashing](https://www.cs.tau.ac.il/~shanir/advanced-seminar-data-structures-2009/bib/pagh01cuckoo.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)
|