Introduction to Algorithms (Eastern Economy Edition) - Softcover

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

Softcover

ISBN 10: 8120340078 ISBN 13: 9788120340077

Publisher: PHI Learning Pvt. Ltd. (Originally MIT Press), 2010

Synopsis

This internationally acclaimed textbook provides a comprehensive introduction to the modern study of computer algorithms. 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 selfcontained and presents an algorithm, a design technique, an application area, or a related topic. The algorithms are described and designed in a manner to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.

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 edgebased flow in the material on flow networks. Many new exercises and problems have been added in this edition. The text is intended primarily for students studying algorithms or data structures. As it discusses engineering issues in algorithm design, as well as mathematical aspects, it is equally well suited for selfstudy by technical professionals.

About this title

About the Author:

Thomas H. Cormen received bachelor’s degree in Electrical Engineering from the Princeton University way back in 1978. Thereafter, he did his master’s in Electrical Engineering and Computer Science from the MIT. Among the students, he is best known for having co-authored a book titled 'Introduction to Algorithms'. In the year 2013, he published another book titled 'Algorithms Unlocked'. This book too has been received well.

Charles E. Leiserson is Professor of Computer Science and Engineering at MIT. Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at MIT. Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.

Review:

"As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference."
—Gabriel Robins, Deptt. of Computer Science, University of Virginia

"Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance."
—Daniel Spielman, Deptt. of Computer Science, Yale University

"In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field."
—Shang-Hua Teng, University of Southern California

About this edition

• Publisher: PHI Learning Pvt. Ltd. (Originally MIT Press)
• Publication date: 2010
• ISBN 10: 8120340078
• ISBN 13: 9788120340077
• Binding: Paperback
• Edition number: 3
• Number of pages: 1312