Jump to content

User:Jbzdak/Books/Algorithms:v2

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Jbzdak (talk | contribs) at 11:18, 10 December 2015 (Created page with '{{saved book |title= |subtitle= |cover-image= |cover-color= | setting-papersize = a4 | setting-toc = auto | setting-columns = 2 }} == Algorithms == ===...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)


Algorithms

Part 2

Persistent data structues
Persistent data structure
Random Algorithms [Theory]
Randomized algorithm
Probabilistically checkable proof
Approximate counting algorithm
Random Algorithms
Set balancing
HyperLogLog
Locality-sensitive hashing
Count–min sketch
Bloom filter
MinHash
Quotient filter
Random binary tree
Random tree
Rapidly exploring random tree
Skip list
Treap
Expected linear time MST algorithm
Entropy compression
Freivalds' algorithm
Random Algorithms [Hard]
Kinetic Alorithms
Kinetic data structure
Kinetic heater
Kinetic hanger
Kinetic heap