7 Dynamic Programming Books recommended by Stackoverflow

The following 7 Dynamic Programming books are based on a diversity of topics on Stackoverflow. While posts like these are often closed on Stackoverflow, they often provide good recommendations, and we would like to bring them to your attention by sharing them here. Have fun reading them!

7 Dynamic Programming Books recommended by Stackoverflow

  • Introduction to Algorithms, Second Edition
    Introduction to Algorithms, Second Edition

    Introduction to Algorithms combines rigor and comprehensiveness. The book moves forward with more advanced algorithms that implement strategies for solving more complicated problems (including dynamic programming techniques, greedy algorithms, and amortized analysis). –Richard Dragan Topics covered: Overview of algorithms (including algorithms as a technology); designing and analyzing algorithms; asymptotic notation; recurrences and recursion; probabilistic analysis and randomized algorithms; heapsort algorithms; priority queues; quicksort algorithms; linear time sorting (including radix and bucket sort); medians and order statistics (including minimum and maximum); introduction to data structures (stacks, queues, linked lists, and rooted trees); hash tables (including hash functions); binary search trees; red-black trees; augmenting data structures for custom applications; dynamic programming explained (including assembly-line scheduling, matrix-chain multiplication, and optimal binary search trees); greedy algorithms (including Huffman codes and task-scheduling problems); amortized analysis (the accounting and potential methods); advanced data structures (including B-trees, binomial and Fibonacci heaps, representing disjoint sets in data structures); graph algorithms (representing graphs, minimum spanning trees, single-source shortest paths, all-pairs shortest paths, and maximum flow algorithms); sorting networks; matrix operations; linear programming (standard and slack forms); polynomials and the Fast Fourier Transformation (FFT); number theoretic algorithms (including greatest common divisor, modular arithmetic, the Chinese remainder theorem, RSA public-key encryption, primality testing, integer factorization); string matching; computational geometry (including finding the convex hull); NP-completeness (including sample real-world NP-complete problems and their insolvability); approximation algorithms for NP-complete problems (including the traveling salesman problem); reference sections for summations and other mathematical notation, sets, relations, functions, graphs and trees, as well as counting and probability backgrounder (plus geometric and binomial distributions).

  • Programming Challenges: The Programming Contest Training Manual (Texts in Computer Science)
    Programming Challenges: The Programming Contest Training Manual (Texts in Computer Science)

    Therearepleasuresinparsimony,insqueezingthelastdropofperformanceoutofclever algorithms and tight coding. Thegames,puzzles,andchallengesofproblemsfrominternationalprogrammingc- petitionsareagreatwaytoexperiencethesepleasureswhileimprovingyouralgorithmic and coding skills. Combining this book with a judge gives an exciting new way to challenge and improve your programming skills.

  • The Algorithm Design Manual
    The Algorithm Design Manual

    Drawing heavily on the author’s own real-world experiences, the book stresses design and analysis. THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains: * a complete hypertext version of the full printed book. * over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.

  • Algorithm Design
    Algorithm Design

    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. August 6, 2009 Author, Jon Kleinberg, was recently cited in the New York Times for his statistical analysis research in the Internet age.

  • Introduction to Algorithms: A Creative Approach
    Introduction to Algorithms: A Creative Approach

    This book emphasizes the creative aspects of algorithm design by examining steps used in the process of algorithms development. The heart of this creative process lies in an analogy between proving mathematical theorems by induction and designing combinatorial algorithms. The book contains hundreds of problems and examples.

  • Introduction to Dynamic Programming: International Series in Modern Applied Mathematics and Computer Science, Volume 1
    Introduction to Dynamic Programming: International Series in Modern Applied Mathematics and Computer Science, Volume 1

    Introduction to Dynamic Programming introduces the reader to dynamic programming and presents the underlying mathematical ideas and results, as well as the application of these ideas to various problem areas. A large number of solved practical problems and computational examples are included to clarify the way dynamic programming is used to solve problems. The final chapter looks at several actual applications of dynamic programming to practical problems, such as animal feedlot optimization and optimal scheduling of excess cash investment.

  • Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)
    Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)

    This is a popular textbook on algorithms and data structures now available in Java version. It provides students with practical means to test Java implementations on real applications.

You may also like...