This book evolved over the past ten years from a set of lecture notes developed by the authors while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego.
The topics were carefully selected and clustered. No attempt was made to be encyclopedic, and this left more spaces to include topics traditionally de-emphasized or omitted from most Algorithms books.
This book consists of four parts:
Part I starts with the historical beginning, RSA cryptosystem, divide-and-conquer algorithms for integer multiplication, sorting and median finding, as well as the fast Fourier transform.
Part II, the most traditional section of the book, concentrates on data structures and graphs; the contrast here is between the intricate structure of the underlying problems and the short and crisp pieces of pseudocode that solve them.
Part III deals with the "sledgehammers" of the trade, techniques that are powerful and general: dynamic programming (a novel approach helps clarify this traditional stumbling block for students) and linear programming (a clean and intuitive treatment of the simplex algorithm, duality, and reductions to the basic problem).
The final Part IV is about ways of dealing with hard problems: NP-completeness, various heuristics, as well as quantum algorithms, perhaps the most advanced and modern topic. As it happens, this book ends the story exactly where it started it, with Shor's quantum algorithm for factoring.
add to del.icio.us
You may use anyone of the download options
Missing Link?, Report It and try these 2 + 1 alternates...
Similar Book titles in Data Structures and Algorithms section:
Handbook of Algorithms and Data Structures
Problems on Algorithms, 2nd Edition
Algorithms and Complexity
Introduction to Algorithms
Design and Analysis of Computer Algorithms
Computer Animation: Algorithms and Techniques
Dictionary of Algorithms and Data Structures
Sorting and Searching Algorithms: A Cookbook
Algorithms in the Real World - Lecture Notes
Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications
How to Think About Algorithms - Loop Invariants and Recursion
Complexity of Algorithms
Algorithms for Communications Systems and their Applications
Algorithms for Programmers
Average Case Analysis of Algorithms on Sequences
Efficient Algorithms for Sorting and Synchronization
Jeff Erickson's Algorithms Course Materials
Similar Book titles in Other sections:
Algorithms for Molecular Biology
Section: CS -> Theory
Information Theory, Inference and Learning Algorithms
Global Optimization Algorithms - Theory and Application
Algorithms For Computing With Modular Forms
Algorithms for Modular Elliptic Curves, Second Edition
Combinatorial Algorithms for Computers and Calculators, Second Edition
Discrete Mathematics with Algorithms
Applied Cryptography: Protocols, Algorithms, and Source Code in C, 2nd Edition
Digraphs Theory, Algorithms and Applications
Section: Microsoft C Sharp (C#)
Data Structures and Algorithms with Object-Oriented Design Patterns in C#
Section: C++ Language
Algorithms And Data Structures in C++
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
Similar Books from Amazon :