Buy Books Online > Algorithms & data structures > INTRODUCTION TO ALGORITHMS
INTRODUCTION TO ALGORITHMS: Book by Thomas H. Cormen

INTRODUCTION TO ALGORITHMS

Product Details:    Share this by email:

ISBN: 9788120340077    Publisher: PHI Learning Year of publishing: 2017     Format:  Paperback No of Pages: 1312        Language: English

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...Read more

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 self-contained 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 edge-based 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 self-study by technical professionals.

"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
Department of Computer Science
Yale University
Read less

About the author: Thomas H. Cormen

Thomas H. Cormen, Professor of Computer Science & former Director Institute for Writing and Rhetoric at Dartmouth College.

|

Charles... Read more

Thomas H. Cormen, Professor of Computer Science & former Director Institute for Writing and Rhetoric at Dartmouth College.

|

Charles E. Leiserson, Professor of Computer Science and Engineering at Massachusetts Institute of Technology.

|

Ronald L. Rivest, Andrew and Erna Viterbi Professor Electrical Engineering and Computer Science at Massachusetts Institute of Technology.

|

Clifford Stein, Professor Industrial Engineering & Operations Research at Columbia University.


Read less

Other books by Thomas H. Cormen

Recommended Books for you - See all

Price: Rs. 1000   Rs.810
You save: Rs.190
Vendor : Shroff, Mumbai
BUY NOW

FREE SHIPPING | Delivered in 5 working days

(Cash on delivery available)

Be assured. 7 days Return & Refund Policy.
Click here

2 offers starting from Rs. 810

Rs.810   FREE SHIPPING

In stock | Delivered in 5 working days

Shroff, Mumbai

Add to cart

Rs.1425   FREE SHIPPING

In stock | Delivered in 21 working days

India Book Centre, Delhi

Add to cart

Rs.200 OFF

on purchase of Rs.500 & above

1.Click on Add to Cart & Proceed to Checkout
2.Under payment options, choose
"Redeem Coupon Code/Gift Certificate"
3.Enter Promo Code "SHOP200"
4.Get Rs.200 off, Pay Balance Amount

Valid upto 21st July,13

Rs.200 OFF

on purchase of Rs.500 & above

Terms & Conditions