
Algorithm design
by Jon Kleinberg, Éva Tardos · first published 1922
68% recommend30% neutral2% critical
Why HN recommends it
Readable, intuitive teaching of algorithm design methodologies, often preferred over CLRS. Its 200+ class-tested problems, many with walkthroughs, suit undergrads and self-learners who want practice and proof skills.
Summarised by Claude from recommending comments
"Algorithm Design takes a fresh approach to the algorithms course, introducing algorithmic ideas through the real-world problems that motivate them. In a clear, direct style, Jon Kleinberg and Eva Tardos teach students to analyze and define problems for themselves, and from this to recognize which design principles are appropriate for a given situation. The text encourages a greater understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science."--Jacket.
Affiliate links. As an Amazon Associate I earn from qualifying purchases.








…The rest is pretty much junk. Please allow me to write down my personal list for those who love to learn: - The Art of Computer Programming - Algorithms (by Dasgupta, Papadimitriou, and Vazirani) - Algorithm Design (by Kleinberg and Tardos) - Feynman Lectures on Physics - Landau & Lifschitz's series - Vladimir Arnold's books on ODEs and Classical Mechanics - Winning Ways for your Mathematical Plays (by Berlekamp…
on “Reading list for those who love to learn” ↗…routine programming, the GoF Design Patterns book will be more helpful to you than algorithms books. But if you really want to learn more about algorithms, check out this book: http://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321... As for programming languages, the java + eclipse combination is excellent.
on “How does one learn about the latest advances in Computer Science (not fads) to apply and improve your work? ” ↗Take an algorithms course at the best university you have access to. Do all the homework. As for books, I really like Algorithm Design [Tardos, Kleinberg]. It has a ton of really well designed problems to work on.
on “How to Pass a Silicon Valley Software Engineering Interview [PDF slides]” ↗…dry and unmotivating. If you don't like standard textbook treatments like CLRS, you might like these: Introduction to Algorithms - A Creative Approach by Udi Manber (out of print but worth getting). Algorithm Design by Klein and Tardos. How to Think About Algorithms by Jeff Edmonds. Jeff Erickson's lecture notes on algorithms: http://www.cs.uiuc.edu/~jeffe/teaching/algorithms/ Jon Bentley's Programming Pearls is…
on “Damn Cool Algorithms: Homomorphic Hashing” ↗What's wrong with less cryptic books like these? http://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321... http://www.amazon.com/Introduction-Algorithms-Third-Thomas-C...
on “Art of Computer Programming, Volumes 1-4A Boxed Set” ↗I read a different book to learn algorithms, 'Algorithm Design' by Kleinberg and Tardos, and I think its a fantastic book, with lots of sample material that actually makes you think. I actually may try this book to see how it compares.
on “Best algorithms book I ever read” ↗I recognized their names from the first example in the classic book "Algorithm Design" by Kleinberg and Tardos. But there it was called Gale-Shapley Algorithm.
on “Nobel Prize in Economics awarded to Roth and Shapley for matching algorithm work” ↗…motivations etc. It provides insight. The second one, after the necessary introduction to the language, shows how he uses C++, or expects to be used, which is interesting in its own way. About algorithms: Algorithm Design by Kleinberg and Tardos. This gives the much needed insight instead of maths equations, data structure implementations or a catalog of what to apply where, which are all good, but are useless without…
on “Ask HN: What are the best textbooks in your field of expertise?” ↗"Algorithm Design" by Kleinberg & Tardos is pretty good. Chapter 6 is its Dynamic Programming chapter, and there are 9 examples in the chapter with pseudocode and analysis. Some of its dynamic programming examples: Weighted…
on “Problem Solving with Algorithms and Data Structures [pdf]” ↗For the general case, the CLRS book is recommended, but I personally found Algorithm Design by Jon Kleinberg and Eva Tardos to be the best introduction in undergrad: https://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/032...
on “Algorithms by Jeff Erickson (2019)” ↗I'd recommend "Algorithm Design" by Jon Kleinberg, Eva Tardos (http://tinyurl.com/232nfh). Covers most of the topics found on the Cormen book but in a much easier to digest language. The exercises and examples are also much more updated.
on “Question: What are the best books on algorithms?” ↗…introductory text: Cormen/Leiserson/Rivest/Stein: Introduction to Algorithms (2nd edition) http://www.amazon.com/Introduction-Algorithms-Thomas-H-Corme... Good advanced text: Jon Kleinberg/Eva Tardos: Algorithm Design http://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321...
on “Ask YC: Data structure or Algorithm selection for a problem?” ↗Some books to read: http://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321... http://www.amazon.com/Design-Patterns-Object-Oriented-Addiso... http://www.amazon.com/Refactoring-Improving-Existing-Addison... http://www.artima.com/shop/forsale
on “Ask YC: Study theory, or keep coding?” ↗I liked the kleinberg/tardos algorithms book better than clrs: www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321295358. I felt it was more direct.
on “The New Classics of Computer Science” ↗I recommend the Kleinberg/Tardos textbook: http://www.amazon.com/Algorithm-Design-Jon-Kleinberg/dp/0321... It is a really enjoyable read and has a nice narrative that I think other algorithm books are lacking. CLR, for instance, just reads like a handbook to me. The goal Kleinberg/Tardos…
on “Ask HN: After SICP, what next?” ↗