
Reserve it at BN.com & pick it up in 60 minutes at your local store.
Enter a zip code
Textbook (Hardcover - 2ND)
TEXTBOOK INFORMATION
| More Formats | |
|---|---|
| Hardcover - New Edition | $65.25 |
NOT AVAILABLE IN THE US OR CANADA.
International Student Paperback Edition.
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.
Paperback not available in U.S. and Canada.
Both rigorous and complete, this introduction covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms. Annotation c. Book News, Inc., Portland, OR (booknews.com)
More Reviews and RecommendationsThomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College.
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
Reader Rating:
See Detailed Ratings
September 17, 2002: this book weighs way too much and keeps me from spending time with my new wife. However, it is a fabulous book for what it actually is. More pictures would be helpful!
Reader Rating:
See Detailed Ratings
December 07, 2000: I have used this book in my Masters level algorithms course before. Unfortunately, it seems to be the best available. The book is way too long. The mathematical introduction is useless. There are few examples and little differentiation between what works in practice and why.