Skiena's Algorithms Lectures
This note covers the following topics: Introduction to Algorithms, Asymptotic Notation, Modeling or Logarithms, Elementary Data Structures, Dictionary data structures, Sorting, Heapsort or Priority Queues, Recurrence Relations, Introduction to NP-completeness, Reductions, Cook's Theorem or Harder Reduction, NP-completeness challenge, Approximation Algorithms and Heuristic Methods.
Author(s): Steven Skiena
NA Pages 
Advanced Algorithms by Anupam Gupta
The PDF covers the following topics related to Computer Algorithms : Discrete Algorithms, Minimum Spanning Trees, Arborescences: Directed Spanning Trees, Dynamic Algorithms for Graph Connectivity, Shortest Paths in Graphs, Low-Stretch Spanning Trees, Graph Matchings I: Combinatorial Algorithms, Graph Matchings II: Weighted Matchings, Graph Matchings III: Algebraic Algorithms, The Curse of Dimensionality, and Dimension Reduction, Dimension Reduction and the JL Lemma, Streaming Algorithms, Dimension Reduction: Singular Value Decompositions, From Discrete to Continuous Algorithms, Online Learning: Experts and Bandits, Solving Linear Programs using Experts, Approximate Max-Flows using Experts, The Gradient Descent Framework, Mirror Descent, The Centroid and Ellipsoid Algorithms, Interior-Point Methods, Combating Intractability, Approximation Algorithms via SDPs, Online Algorithms, Additional Topics, Prophets and Secretaries.
Author(s): Anupam Gupta
309 Pages
Design And Analysis Of Algorithms by Herbert Edelsbrunner
This book focuses on fundamental data structures and graph algorithms. The emphasis will be on algorithm design and on algorithm analysis.
Author(s): Herbert Edelsbrunner
95 Pages
Advanced Algorithms by Prof. Michel Goemans
This note is designed for doctoral students interested in theoretical computer science. Topics covered includes: Fibonacci heaps, Network flows, Maximum flow, minimum cost circulation, Goldberg-Tarjan min-cost circulation algorithm, Cancel-and-tighten algorithm; binary search trees, Splay trees, Dynamic trees , Linear programming, LP: duality, geometry, simplex, LP: complexity, ellipsoid algorithm, LP: applications of the ellipsoid algorithm, Conic programming, Approximation algorithms, Max-cut and sparsest-cut, Multi-commodity flows and metric embeddings, Convex hulls.
Author(s): Prof. Michel Goemans
NA Pages
Design And Analysis Of Algorithms by Herbert Edelsbrunner
This book focuses on fundamental data structures and graph algorithms. The emphasis will be on algorithm design and on algorithm analysis.
Author(s): Herbert Edelsbrunner
95 Pages
This note covers the following topics: Introduction to Algorithms, Asymptotic Notation, Modeling or Logarithms, Elementary Data Structures, Dictionary data structures, Sorting, Heapsort or Priority Queues, Recurrence Relations, Introduction to NP-completeness, Reductions, Cook's Theorem or Harder Reduction, NP-completeness challenge, Approximation Algorithms and Heuristic Methods.
Author(s): Steven Skiena
NA Pages
Data Structures and Algorithm Analysis
This book is designed as a teaching text that covers most standard data structures, but not all. A few data structures that are not widely adopted are included to illustrate important principles.
Author(s): Clifford A. Shaffer
NA Pages
Design and Analysis of Computer Algorithms (PDF 135P)
This lecture note discusses the approaches to designing optimization algorithms, including dynamic programming and greedy algorithms, graph algorithms, minimum spanning trees, shortest paths, and network flows. Also it briefly discusses algorithmic problems arising from geometric settings, that is, computational geometry.
Author(s): David M. Mount
135 Pages
Information Theory, Inference, and Learning Algorithms (David J.C. MacKay)
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
Data Structures and Algorithms (John Morris)
These notes were prepared for the Programming Languages and System Design course in the BE (Information Technology) course at the University of Western Australia. The course note covers the following topics: Algorithm Complexity, Classes of Efficient Algorithms, Searching, Queues, Sorting, Graphs, Huffman Encoding, Fast Fourier Transforms, Matrix Chain Multiplication, Intractible Problems and Alpha-Beta search.
Author(s): John Morris
NA Pages
Dictionary of Algorithms and Data Structures
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
