• Title: Algorithm Design
• Author(s) Jon Kleinberg and Eva Tardos
• Publisher: Pearson; 1st edition (March 16, 2005); eBook (Internet Archive Edition)
• Hardcover: 864 pages
• eBook: PDF (864 pages), ePub, Kindle, etc.
• Language: English
• ISBN-10/ASIN: 0321295358
• ISBN-13: 978-0321295354
• Share This:  

Book Description

This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches 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.

• Jon Kleinberg is a Tisch University Professor of Computer Science at Cornell University. His research focuses on issues at the interface of networks and information, with an emphasis on the social and information networks that underpin the Web and other on-line media.
• Eva Tardos is a Hungarian mathematician and the Jacob Gould Schurman Professor of Computer Science at Cornell University

• Amazon

• Algorithms and Data Structures
• Computational Complexity
• Operations Research (OR), Linear Programming, Optimization, and Approximation

• Algorithm Design (Jon Kleinberg, et al)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF
• The Mirror Site (3) - PDF
• Book Homepage (Lecture Slides, Extra Topics, etc.)

• Lecture Notes for the Algorithms (Jeff Erickson)

  This lecture notes uniquely combines rigor and comprehensiveness. It covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study.

• Algorithms, 4th Edition, by Robert Sedgewick and Kevin Wayne

  It surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the book. We motivate each algorithm that we address by examining its impact on specific applications.

• Algorithms: Fundamental Techniques (Macneil Shonle, et al)

  The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

• Elementary Algorithms (Xinyu Liu)

  This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

• Algorithms and Data Structures (Niklaus Wirth)

  From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). It includes new material on sequential structure, searching and priority search trees.

• The Algorithm Design Manual (Steven S. Skiena)

  This book serves as the primary textbook for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms, intended as a manual on algorithm design for both students and computer professionals.

• Introduction to Design Analysis of Algorithms (K. Raghava Rao)

  This book was very useful to easily understand the algorithms. This book is having enough examples on every algorithm. It has written for the sake of students to provide complete knowledge on Algorithms.

• Clever Algorithms: Nature-Inspired Programming Recipes

  The book describes 45 algorithms from the field of Artificial Intelligence. All algorithm descriptions are complete and consistent to ensure that they are accessible, usable and understandable by a wide audience.