Computer Science Bookscomputer algorithm Books

Introduction to Algorithms

Advertisement

Introduction to Algorithms

Introduction to Algorithms

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):

s459 Pages

Advertisement

Advertisement

Similar Books
Advanced Algorithms Lectures and Resources

Advanced Algorithms Lectures and Resources

This note will cover classic and modern algorithmic ideas that are central to many areas of Computer Science. The focus is on most powerful paradigms and techniques of how to design algorithms, and measure their efficiency. The topics will include hashing, sketching, dimension reduction, linear programming, spectral graph theory, gradient descent, multiplicative weights, compressed sensing, and others.

sNA Pages
Design and Analysis of Algorithms Course Notes

Design and Analysis of Algorithms Course Notes

This note explains core material in data structures and algorithm design, and also helps students prepare for research in the field of algorithms. Topics covered includes: Splay Trees, Amortized Time for Splay Trees, Maintaining Disjoint Sets, Binomial heaps, F-heap, Minimum Spanning Trees, Fredman-Tarjan MST Algorithm, Light Approximate Shortest Path Trees, Matchings, Hopcroft-Karp Matching Algorithm, Two Processor Scheduling, Network Flow - Maximum Flow Problem, The Max Flow Problem and Max-Flow Algorithm.

s161 Pages
Introduction to the Design and Analysis of Algorithms

Introduction to the Design and Analysis of Algorithms

This note introduces a number of important algorithm design techniques as well as basic algorithms that are interesting both from a theoretical and also practical point of view. Topics covered are: Introduction to Algorithms, Asymptotic Analysis, Recurrence Equations, Sorting Algorithms, Search Trees, Randomized Algorithms and Quicksort, Selection Algorithms, Number Theory and Cryptography Algorithms, Graph algorithms, Greedy Algorithms and External Memory Algorithms.

sNA Pages
Applied Algorithms Lecture Slides

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.

sNA Pages
Algorithms Lecture Notes

Algorithms Lecture Notes

This note covers the following topics: Mathematics for Algorithmic, Greedy Algorithms, Divide and Conquer Algorithms, Dynamic Programming, Amortized Analysis, Hash Table, Binary Search Tree, Graph Algorithms, String Matching, Sorting and Approximate Algorithms

sNA Pages
Computer Programming Algorithms Directory

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.

sNA Pages
Algorithms (Shai Simonson)

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.

sNA Pages
Introduction to Complexity Theory (Oded Goldreich)

Introduction to Complexity Theory (Oded Goldreich)

This book explains the following topics: intrinsic complexity of computational tasks, Computational Complexity, P, NP, and NP-Completeness, relations between various computational phenomena.

sNA Pages
List of algorithms Mirror

List of algorithms Mirror

Currently this section contains no detailed description for the page, will update this page soon.

s Pages
Lecture Notes on Computational Complexity (Luca Trevisan)

Lecture Notes on Computational Complexity (Luca Trevisan)

Currently this section contains no detailed description for the page, will update this page soon.

s Pages