The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.
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 exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Anbieter: Bellwetherbooks, McKeesport, PA, USA
hardcover. Zustand: Acceptable. DAMAGED - Bruise/tear to cover/spine. Bestandsnummer des Verkäufers mon0000026299
Anzahl: Mehr als 20 verfügbar
Anbieter: thebookforest.com, San Rafael, CA, USA
Zustand: Very Good. Text block firm and clean, binding unblemished, boards straight, without highlights or underlining. Very clean, nearly like new. Without any discs, access codes or extra items. Well packaged and promptly shipped from California. Partnered with Friends of the Library since 2010. Bestandsnummer des Verkäufers BAY_06_SH_031167
Anzahl: 1 verfügbar
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Zustand: Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. Bestandsnummer des Verkäufers 00110069387
Anzahl: 2 verfügbar
Anbieter: booksdeck, Santa clara, CA, USA
Softcover. Zustand: NEW. Brand new book. International edition printed overseas but with similar contents as compared to the US edition. Book will have a different ISBN and cover art and paperback bound. Same day shipping with tracking. Bestandsnummer des Verkäufers 55|9780262033848
Anzahl: Mehr als 20 verfügbar
Anbieter: World of Books (was SecondSale), Montgomery, IL, USA
Zustand: Acceptable. Item in acceptable condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Bestandsnummer des Verkäufers 00110847902
Anzahl: 1 verfügbar
Anbieter: -OnTimeBooks-, Phoenix, AZ, USA
Zustand: good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail. Bestandsnummer des Verkäufers OTV.0262033844.G
Anzahl: 10 verfügbar
Anbieter: -OnTimeBooks-, Phoenix, AZ, USA
Zustand: very_good. Gently read. May have name of previous ownership, or ex-library edition. Binding tight; spine straight and smooth, with no creasing; covers clean and crisp. Minimal signs of handling or shelving. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships USPS Media Mail. Bestandsnummer des Verkäufers OTV.0262033844.VG
Anzahl: 2 verfügbar
Anbieter: Goodwill San Antonio, San Antonio, TX, USA
Zustand: good. Bestandsnummer des Verkäufers 4Q2SPP001ZME
Anzahl: 1 verfügbar
Anbieter: World of Books Inc, Montgomery, IL, USA
Hardback. Zustand: Good. The latest edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.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 exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide. Bestandsnummer des Verkäufers CIN0262033844G
Anzahl: 2 verfügbar
Anbieter: Greenworld Books, Arlington, TX, USA
Zustand: very_good. Fast Free Shipping â" Very Good condition book with a firm cover and clean pages. Shows normal use and some light wear or limited notes markings. A solid, nice copy to enjoy. Bestandsnummer des Verkäufers GWV.0262033844.VG
Anzahl: 2 verfügbar