Advertisement
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 
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 explains the following topics related to Algorithm Analysis and Design: Introduction to Design and analysis of algorithms, Growth of Functions, Recurrences, Solution of Recurrences by substitution,Recursion tree method, Master Method, Design and analysis of Divide and Conquer Algorithms, Worst case analysis of merge sort, quick sort and binary search, Heaps and Heap sort, Priority Queue, Lower Bounds for Sorting.
Author(s): Mr. S.K. Sathua, Dr. M.R. Kabat and Dr. R. Mohanty
80 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
Data Structures and Algorithms The Basic Toolbox
This book is a concise introduction to this basic toolbox, intended for students and professionals familiar with programming and basic mathematical language.
Author(s): K. Mehlhorn and P. Sanders
NA Pages
Applied Algorithms Lecture Slides
This note covers the following topics: Introduction, Stable Matching, Graph Algorithms, Greedy Algorithms, Minimum Spanning Trees, Recurrences, Dynamic programming, Network Flow and Network Flow Applications.
Author(s): Richard Anderson
NA Pages
Lecture Notes Introduction to Computer Algorithms
This course note provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.
Author(s): Prof. Erik Demaine, Prof. Ronald Rivest and Prof. Srinivas Devadas
NA Pages
Information Retrieval (C.J. van Rijsgergen)
The material of this book is aimed at advanced undergraduate information (or computer) science students, postgraduate library science students, and research workers in the field of IR. Some of the chapters, particular chapter 6, make simple use of a little advanced mathematics.
Author(s): C.J. van Rijsgergen
NA Pages
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
Dictionary of Algorithms and Data Structures
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
Pages
Algorithms for Programmers (Jrg Arndt)
Currently this section contains no detailed description for the page, will update this page soon.
Author(s):
PagesAdvertisement
