Algorithms – notes
Lists
 Oneway linear list “is a sequence of cells each of which (except the last) points to its successor.”
Heap, priority queues
https://en.wikipedia.org/wiki/Heap_(data_structure)
Trees
 Van Emde Boas tree / priority queue – “also known as a vEB tree, is a tree data structure which implements an associative array with mbit integer keys. It performs all operations in O(log m) time, or equivalently in O(log log M) time, where M = 2m is the maximum number of elements that can be stored in the tree. […]”.
 Fractal tree index
 Btrees, Shadowing, and Clones – Ohad Rodeh – 2007 – publication, filesystems related, found through larch: Python Btree library.
Hash/map

[New Concurrent Hash Maps for C++ 2016, Jeff Preshing](http://preshing.com/20160201/newconcurrenthashmapsforcpp/) (as well as [Using Quiescent States to Reclaim Memory 2016, Jeff Preshing](http://preshing.com/20160726/usingquiescentstatestoreclaimmemory/)).
Other concepts

[What is RCU, Fundamentally ? 2007, lwn.net](https://lwn.net/Articles/262464/)
Diskbased data structures
 Blog post: Datastructures for external memory – 2016 by Max Bolingbroke
 Online course: Diskbased data structures (Lecture #16, by Dr. Naveen Garg, ~2009) – NPTEL.ac.in (vidéo course)
Books
 Algorithms, Etc (lecture notes by Jeff Erickson) (PDF with all lecture notes, 1200+ pages)
 Elementary Algorithms (online free ebook, by github.com/liuxinyu95) (PDF v0.618033).
Other
 github.com/haseebr/competitiveprogramming/ stores PDFs of various ebooks.
 github.com/waydecs/books likewise.
Misc.
 msgpack (for C/C++) – binary serialization library.
 OpenDHT – A C++11 Distributed Hash Table implementation.
EOF