Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book 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 can be used as a unit of study. The algorithms are described in English and in a pseudocode designed 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 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, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. 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. As of the third edition, this textbook is published exclusively by the MIT Press. The hardcover edition does not include a dust jacket.
| ||||||||||||||||||||||||
Kurzbeschreibung
Wird oft zusammen gekauft
Produktinformation
|
Mehr über die Autoren
Entdecken Sie Bücher, lesen Sie über Autoren und mehr
Produktbeschreibungen
Pressestimmen
"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, Department 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, Department of Computer Science, Yale University -- Daniel Spielman " 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
Über den Autor
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009). 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.
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
In diesem Buch
(Mehr dazu)
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis
Kundenrezensionen
Die hilfreichsten Kundenrezensionen
Format:Kindle Edition|Von Amazon bestätigter Kauf
This book provides an excellent overview about algorithms in different areas of computing problems.
Unlike some other books, it does not just describe the various algorithms but rather explains the design concepts related to these algorithms and how the reader can apply them when designing algorithms.
In fact the scope of this book is so extensive, that its title "Introduction to Algorithms" looks like an understatement.
This book is a treasure that belongs in every software engineer's bookshelf, be it as a first-time introduction or as a means of recalling what you once might have heard in a computer-science course.
Unlike some other books, it does not just describe the various algorithms but rather explains the design concepts related to these algorithms and how the reader can apply them when designing algorithms.
In fact the scope of this book is so extensive, that its title "Introduction to Algorithms" looks like an understatement.
This book is a treasure that belongs in every software engineer's bookshelf, be it as a first-time introduction or as a means of recalling what you once might have heard in a computer-science course.
5 von 8 Kunden fanden die folgende Rezension hilfreich
Von Athene
Format:Taschenbuch
I study computing science and can really recommend this book.
Overview:
+ contains all necessary basic information of algorithms
+ there are a lot of helpful and good explanations
+ you can also practice with it - there are a lot of exercises
- there are no solutions to the exercises
I like the book because I always find an answer if anything is not clear to me. I think sooner or later you need it during the study or when you are confronted with and interested in algorithms (and data structure) .
Overview:
+ contains all necessary basic information of algorithms
+ there are a lot of helpful and good explanations
+ you can also practice with it - there are a lot of exercises
- there are no solutions to the exercises
I like the book because I always find an answer if anything is not clear to me. I think sooner or later you need it during the study or when you are confronted with and interested in algorithms (and data structure) .
1 von 3 Kunden fanden die folgende Rezension hilfreich
Von feedback
Format:Taschenbuch
The content of the book is very wide and completely rigorous. I'm quite sure that this is the best book on algorithms available.
(And of course the autors are complete animals)
(And of course the autors are complete animals)
Möchten Sie weitere Rezensionen zu diesem Artikel anzeigen?
›
Gehen Sie zu Amazon.com, um alle 87 Rezensionen zu sehen
4.3 von 5 Sternen
Waren diese Rezensionen hilfreich?
Wir wollen von Ihnen hören.
Kunden diskutieren
|
Das Forum zu diesem Produkt
Fragen stellen, Meinungen austauschen, Einblicke gewinnen Aktive Diskussionen in ähnlichen Foren
Kundendiskussionen durchsuchen
|
Ähnliche Foren
|
||||||||||||||||||||||||||||||||||
Lieblingslisten
|
|
Ähnliche Artikel finden
Ihr Kommentar
Möchten Sie die Produktinformationen aktualisieren oder Feedback zu den Produktabbildungen geben?
|
