Introduction to algorithms. 3rd ed. (English) Zbl 1187.68679

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford

Cambridge, MA: MIT Press (ISBN 978-0-262-03384-8/hbk; 978-0-262-53305-8/pbk). xix, 1292 p. (2009).

The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, and substantial additions to the chapter on recurrences (now called “Divide-and-Conquer”). It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition.
See the review of the second edition (2001) in Zbl 1047.68161.

MSC:

68W05	Nonnumerical algorithms
90C05	Linear programming
68W40	Analysis of algorithms
68-01	Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science
68W20	Randomized algorithms

Keywords:

probabilistic analysis; randomized algorithms; linear programming; van Emde Boas trees; multithreaded algorithms