Lecture Notes on Design and Analysis of Algorithms
This note describes the following topics: Greedy methods, Dynamic programming, Backtracking, Branch and bound.
Author(s): Annamalai University
96 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
Lecture Notes On Design And Analysis Of Algorithms
This note covers the following topics: Design and analysis of algorithms, Growth of Functions, Recurrences, Solution of Recurrences by substitution, Recursion tree method, Master Method, Worst case analysis of merge sort, quick sort and binary search, Design and analysis of Divide and Conquer Algorithms, Heaps and Heap sort, Priority Queue, Lower Bounds for Sorting, Dynamic Programming algorithms, Matrix Chain Multiplication, Elements of Dynamic Programming, Longest Common Subsequence, Greedy Algorithms, Activity Selection Problem, Elements of Greedy Strategy, Fractional Knapsack Problem, Huffman Codes, Graph Algorithm - BFS and DFS, Minimum Spanning Trees, Kruskal algorithm, Prim's Algorithm, Fourier transforms and Rabin-Karp Algorithm.
Author(s): Dr. Subasish Mohapatra
125 Pages
Data Structures And Algorithms by Sugih Jamin
This note covers the following topics: Algorithm Analysis, algorithmic patterns, Standard I/O and iostream, Foundational Data Structures and Basic Abstract Data Types, Linked-list, Stacks and Queues, PA1 walkthrough, Pointer, Hashing, Recursion and Recurrence Relations, Trees, Binary Search Trees, Range and Multidimensional Searches, Heaps, Tries, Balanced Search Trees, Binary-tree Representations of Multi-way Trees.
Author(s): Sugih Jamin
NA Pages
Advanced Algorithms Lectures by Shuchi Chawla
This note introduces students to advanced techniques for the design and analysis of algorithms, and explores a variety of applications. Topics covered includes: Greedy algorithms, Dynamic programming, Network flow applications, matchings, Randomized algorithms, Karger's min-cut algorithm, NP-completeness, Linear programming, LP duality, Primal-dual algorithms, Semi-definite Programming, MB model contd., PAC model, Boosting in the PAC framework.
Author(s): Shuchi Chawla
195 Pages
Introduction to Algorithms Lecture Notes
This note concentrates on the design of algorithms and the rigorous analysis of their efficiency. Topics covered includes: the basic definitions of algorithmic complexity, basic tools such as dynamic programming, sorting, searching, and selection; advanced data structures and their applications, graph algorithms and searching techniques such as minimum spanning trees, depth-first search, shortest paths, design of online algorithms and competitive analysis.
Author(s): Michael Dinitz
NA Pages
