Algorithm Design

Front Cover
Pearson/Addison-Wesley, 2006 - Computers - 838 pages
Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. The book teaches students a range of design and analysis techniques for problems that arise in computing applications. The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science.

August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age.

What people are saying - Write a review

User Review - Flag as inappropriate

Well, this is the BEST book on the design of Algorithms among its contemporaries. I've gone through most of the books on Algorithm Design, including the famed Cormen, but this one beats them all.
Every chapter is carefully written. Every idea is neatly presented, along with the motivation that led to it. Various lemmas and proofs leading to the structure/correctness of algorithms are succinctly given. Every concept is treated in the best manner possible, and all the hidden turns and tweaks become visibly evident. Moreover, the language is friendly to the extent that the book can be read as a novel. The end-of-the-chapter exercises are few of the best one can ever ask for, truly enhancing one's understanding of concepts.
If you are even remotely interested in Algorithms, this book is a must-have.

Other editions - View all

Bibliographic information