Show more. Show less. About the Authors. Thomas H. He is the coauthor with Charles E. Leiserson, Ronald L. Privacy Policy. New eBooks. Search Engine. Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book 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. Search Search. Search Advanced Search close Close. Rivest and Clifford Stein The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. Request Permissions Exam copy. Overview Author s Praise. Summary The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.
Instructor Resources Downloadable instructor resources available for this title: instructor's manual, file of figures in the book, and pseudocode.
July Share Share Share email. Authors Thomas H. This course provides an introduction to mathematical modeling of computational problems. It covers the common algorithms, algorithmic paradigms, and data structures used to solve these problems.
The course emphasizes the relationship between algorithms and programming, and introduces basic performance measures and analysis techniques for these problems. OCW has published multiple versions of this subject. This course is the first part of a three-course sequence. The sequence continues in 6. Learn more. Erik Demaine, and Srini Devadas.
0コメント