
Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer – no Kindle device required. Learn more
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera, scan the code below and download the Kindle app.


Introduction to Algorithms third Edition by Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; published by The MIT Press Hardcover [Paperback] Paperback
Amazon Price | New from | Used from |
Kindle Edition
"Please retry" | — | — |
Paperback
"Please retry" |
—
| $67.00 | — |
Customers who viewed this item also viewed
Product details
- ASIN : B008F1DKXU
- Item weight : 1.63 kg
- Best Sellers Rank: #1,299,354 in Books (See Top 100 in Books)
- Customer Reviews:
About the authors
Thomas H. Cormen is Emeritus Professor and former Chair of the Dartmouth College Department of Computer Science and former director of the Dartmouth College Institute for Writing and Rhetoric. He received the B.S.E. degree in Electrical Engineering and Computer Science from Princeton University in 1978 and the S.M. and Ph.D. degrees in Electrical Engineering and Computer Science from MIT in 1986 and 1993, respectively. He is coauthor of the leading textbook on computer algorithms, Introduction to Algorithms, which he wrote with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book, now in its fourth edition, has been translated into several languages. He is also the author of Algorithms Unlocked, a gentle introduction to understanding computer algorithms and how they relate to real-world problems.
Outside computer science, Cormen likes skating (inline and nordic), paddling, and cooking and eating barbecue. He considers himself the world's worst electrician who has a Ph.D. in electrical engineering.
Ronald Linn Rivest (/rɪˈvɛst/; born May 6, 1947) is a cryptographer and an Institute Professor at MIT. He is a member of MIT's Department of Electrical Engineering and Computer Science (EECS) and a member of MIT's Computer Science and Artificial Intelligence Laboratory (CSAIL). He was a member of the Election Assistance Commission's Technical Guidelines Development Committee, tasked with assisting the EAC in drafting the Voluntary Voting System Guidelines.
Rivest is one of the inventors of the RSA algorithm (along with Adi Shamir and Len Adleman). He is the inventor of the symmetric key encryption algorithms RC2, RC4, RC5, and co-inventor of RC6. The "RC" stands for "Rivest Cipher", or alternatively, "Ron's Code". (RC3 was broken at RSA Security during development; similarly, RC1 was never published.) He also authored the MD2, MD4, MD5 and MD6 cry.ptographic hash functions. In 2006, he published his invention of the ThreeBallot voting system, a voting system that incorporates the ability for the voter to discern that their vote was counted while still protecting their voter privacy. Most importantly, this system does not rely on cryptography at all. Stating "Our democracy is too important," he simultaneously placed ThreeBallot in the public domain.
Bio from Wikipedia, the free encyclopedia. Photo by Ronald L. Rivest (Own work) [CC BY-SA 4.0 (http://creativecommons.org/licenses/by-sa/4.0)], via Wikimedia Commons.
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Clifford Seth Stein (born December 14, 1965), a computer scientist, is a professor of industrial engineering and operations research at Columbia University in New York, NY, where he also holds an appointment in the Department of Computer Science. Stein is chair of the Industrial Engineering and Operations Research Department at Columbia University. Prior to joining Columbia, Stein was a professor at Dartmouth College in New Hampshire.
Stein's research interests include the design and analysis of algorithms, combinatorial optimization, operations research, network algorithms, scheduling, algorithm engineering and computational biology.
Stein has published many influential papers in the leading conferences and journals in his fields of research, and has occupied a variety of editorial positions including in the journals ACM Transactions on Algorithms, Mathematical Programming, Journal of Algorithms, SIAM Journal on Discrete Mathematics and Operations Research Letters. His work has been funded by the National Science Foundation and the Sloan Foundation. As of November 1, 2015, his publications have been cited over 46,000 times, and he has an h-index of 42.
Stein is the winner of several prestigious awards including an NSF Career Award, an Alfred Sloan Research Fellowship and the Karen Wetterhahn Award for Distinguished Creative or Scholarly Achievement. He is also the co-author of two textbooks:
Introduction to Algorithms, with T. Cormen, C. Leiserson and R. Rivest, which is currently the best-selling textbook in algorithms and has been translated into 8 languages. About 39,500 of Stein's 46,000 citations are made to this book.
Discrete Math for Computer Science, with Ken Bogart and Scot Drysdale, which is a new textbook that covers discrete math at an undergraduate level.
Stein earned his B.S.E. from Princeton University in 1987, a Master of Science from The Massachusetts Institute of Technology in 1989, and a PhD also from the Massachusetts Institute of Technology in 1992.
In recent years, Stein has built up close ties with the Norwegian research community which earned him an honorary doctorate from the University of Oslo (May 2010).
Bio from Wikipedia, the free encyclopedia. Photo by Sergio01 (Own work) [CC BY-SA 3.0 (http://creativecommons.org/licenses/by-sa/3.0) or GFDL (http://www.gnu.org/copyleft/fdl.html)], via Wikimedia Commons.
Customer reviews

-
Top reviews
Top reviews from Canada
There was a problem filtering reviews right now. Please try again later.
The book is well written and it covers a lot of topics.
It is very rigorous indeed. It's actually empathizes rigor over accessibility.
For a beginner like me it feels like learning to speech by reading the dictionary.
I would advise you buy this book of you already know the topic a minimum but need a reference OR if you are using it as a textbook in class.
To give you an idea of the target audience, there I actually stumbled upon an instance where the book had something like this:
"By exercise XXX, some given property is true" where XXX is an exercise given at the end of a previous chapter.
Come on... Can you not, for the lone learner, explain why such property is true?
And the book also mentions that only a portion of the exercises have correction because they want the teachers to be able to give exercise and make sure the students cannot google the solution.
It does make sense. But it's another hint of the targeted audience.
I will still rate 4, because as a reference book it's good.
But beginners: you've been warned.
I have followed a course on discrete mathematics and it is in my opinion a must to have a chance at understanding this book without being overwhelmed. The reason I am not giving it 5 stars is because there is only a subset of solved exercises in the link provided within the book. Also, the book is not taking any shortcuts to teach you about algorithms so get ready to have pen and paper at hand and even a compiler to implement the pseudo-codes on your own to truly understand them.
I recommend a quick first-pass of the book and once you're ready take a good month to study in detail the chapters of interest to your field.
I read this book long time ago, and plan to keep a hard copy as part of collection. Although it won't change its classic content, the dent does make me feel a bit disappointed.

I read this book long time ago, and plan to keep a hard copy as part of collection. Although it won't change its classic content, the dent does make me feel a bit disappointed.

1. It is a hard cover, but the corner edges are somewhat bended. I am a book person, I like my book to be in perfect condition. But I guess it is done during the transportation, and the wrap being too tight.
2. The paper quality is not good, very soft and thin, need to flip the page with extreme care
3. The print quality is not in a perfect condition, some page, it is crystal clear, some page it is not, looks like it is fading away
4. There are pages the print is more than 80% faded, not clear to read, I will need to look for a pdf version to see if I can figure out what is printed
5. Last thing I'd like point out is that it might appear the seller is from US, however it is from India, I didn't know until the shipment is sent. I would have preferred if it is from U.S.
Lastly I guess you get what you pay for, just hope there are no missing information from the book. I will be reading it soon. I am also getting it for the purpose of collection as well.
------------
Edit: The binding is so horrible, paper is so thin, print is fading, need to emphasize I really hate the binding, i just i discovered today when I had a closer look. changing it to 2 star
Top reviews from other countries

But I got it for a price of 900 Rs. Still, it's not correct for the seller to ship a Xerox copy. And the quality of the xerox is not good as well because in many pages, the ink is too light and almost not readable.
Coming to the book itself, it's a great book and no doubt it. Recommend this book to anyone who wants to study algorithms.



Reviewed in the United Kingdom 🇬🇧 on March 24, 2019



On balance given 5* for comprehensive coverage of algorithms and clear descriptions - but don't expect a pure cookbook of algorithms that can be typed in or downloaded.

That said, the approach, whilst detailed, is at times quite dry and heavy going, and could perhaps be broken up a little more to keep the reader refreshed and focused.