Foto genérica
Foto genérica
Introduction to Algorithms, Third Edition by Charles E. Leiserson, Thomas H. Cormen, Ronald L. Rivest and Clifford Stein (2009, Hardcover)
N
newworld (518)
100% de votos positivos
Precio:
USD89,43
Aproximadamente78,30 EUR
+ USD31,17 de envío
Devoluciones:
30 días para devoluciones. El comprador paga el envío de la devolución..
Estado:
new, hardcover
- ¡Cómpralo ya!Introduction to Algorithms, Third Edition by Charles E. Leiserson, Thomas H....
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Acerca de este artículo
Product Information
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.Product Identifiers
PublisherMIT Press
ISBN-100262033844
ISBN-139780262033848
eBay Product ID (ePID)73175956
Product Key Features
Number of Pages1312 Pages
Publication NameIntroduction to Algorithms, Third Edition
LanguageEnglish
SubjectProgramming / Algorithms, Référence, Algebra / General
Publication Year2009, 2000-2010
TypeTextbook
AuthorRonald L. Rivest, Charles E. Leiserson, Thomas H. Cormen, Clifford Stein
Subject AreaComputers, Mathematics
FormatHardcover
Dimensions
Item Height2.1 in
Item Weight80.2 Oz
Item Length9.4 in
Item Width8.3 in
Weight79.4 Oz
Additional Product Features
Edition Number3
LCCN2009-008593
Reviews" 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, "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, "In light of the explosive growth in the amount of data and the diversity of computing applications, efficient algorithms are needed now more than ever. This beautifully written, thoughtfully organized book is the definitive introductory book on the design and analysis of algorithms. The first half offers an effective method to teach and study algorithms; the second half then engages more advanced readers and curious students with compelling material on both the possibilities and the challenges in this fascinating field." -Shang-Hua Teng, University of Southern California, "As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen 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
Dewey Edition22
Publication Date2009-07-31
Age Range18
Target AudienceTrade
IllustratedYes
Dewey Decimal005.1
Edition Description3rd Edition
Lc Classification NumberQa76.6.I5858 2009
