Algorithms (Shai Simonson)
This note covers the design of algorithms according to methodology and application. Methodologies include: divide and conquer, dynamic programming, and greedy strategies. Applications involve: sorting, ordering and searching, graph algorithms, geometric algorithms, mathematical (number theory, algebra and linear algebra) algorithms, and string matching algorithms.
Author(s): Shai Simonson
NA Pages 
Advanced Algorithms by BMS College of Engineering
he PDF covers the following topics related to Computer Algorithms : Dynamic programming, Application domain of DP, Matrix Chain Multiplication, MCP DP Steps, Recursive Tree, Longest Increasing Subsequence, Dynamic programming, Rod cutting -4 inch rod example, DP for rod cutting, Bottom up approach.
Author(s): BMS College of Engineering
152 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
In computer science, an algorithm is a self-contained step-by-step set of operations to be performed. Topics covered includes: Algorithmic Primitives for Graphs, Greedy Algorithms, Divide and Conquer, Dynamic Programming, Network Flow, NP and Computational Intractability, PSPACE, Approximation Algorithms, Local Search, Randomized Algorithms.
Author(s): Jon Kleinberg and Eva Tardos
459 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
This note covers the following topics: Fundamentals of data structure, simple data structures, ideas for algorithm design, the TABLE Data Type, free storage management, sorting, storage on external media, variants on the SET Data Type, pseudo-random numbers, data compression, algorithms on graphs, algorithms on strings and Geometric Algorithms.
Author(s): Martin Richards
80 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
Computer Programming Algorithms Directory
This note covers the following topics: Encryption Algorithms, Genetic Algorithms, Geographic Information Systems Algorithms, Sorting Algorithms, Search Algorithms, Tree Algorithms, Computational Geometry Algorithms, Phonetic Algorithms and Project Management Algorithms.
Author(s): algosort.com
NA Pages
An Introduction to Computational Complexity
This note covers the following topics: Computational Models, Complexity measures, Power increasing resourses, Basic relatton amomg the models and measures, Reducibility, completeness and closure under reductions, Deterministics and nondeterministics logarithmic space, Deterministics polynomial time, Polynomial Hierarchy and Polynomial space.
Author(s): Martin Tompa
85 Pages
Handbook of Algorithms and Data Structures (G. Gonnet, R. Baeza Yates)
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
