Advanced Algorithms and data structures/ Marcello LaRocca.

Introducing data structures -- Improving priority queues: d-way heaps -- Treaps: Using randomization to balance binary search trees -- Bloom filters: Reducing the memory for tracking content -- Disjoint sets: Sub-linear time processing --Trie, radix trie: Efficient string search -- Use case: LRU cache -- Nearest neighbors search -- K-d trees: Multidimensional data indexing --Similarity Search Trees: Approximate nearest neighbors search for image retrieval -- Applications of nearest neighbor search -- Clustering -- Parallel clustering: MapReduce and canopy clustering -- An introduction to graphs: Finding paths of minimum distance -- Graph embeddings and planarity: Drawing graphs with minimal edge intersections -- Gradient descent: Optimization problems (not just) on graphs -- Simulated annealing: Optimization beyond local minima --Genetic algorithms: Biologically inspired, fast-converging. optimization