Master your Minecraft
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Tour our stores


    Recently Viewed clear list


    New Favorites | November 25, 2014

    Powell's Staff: IMG Our Favorite New Favorites of 2014



    Every week, we gather together a small pile of newly released titles that we agree should be on everyone's radar. We deem these titles our New... Continue »

    spacer
$104.05
New Trade Paper
Ships from International Warehouse (read more)
Add to Wishlist
available for shipping only
Not available for In-store Pickup
Qty Store Section
1 International Warehouse Software Engineering- Algorithms

Introduction to Algorithms, Third Edition

by

Introduction to Algorithms, Third Edition Cover

 

  1. This particular item is stocked in an International Warehouse and will ship separately from other items in your shopping cart.

Synopses & Reviews

Publisher Comments:

andlt;Pandgt;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 andquot;Divide-and-Conquerandquot;), 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.andlt;/Pandgt;

Synopsis:

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.

Synopsis:

andlt;Pandgt;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.andlt;/Pandgt;

Synopsis:

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.

About the Author

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.

Product Details

ISBN:
9780262533058
Author:
Stein, Clifford
Publisher:
The MIT Press
Author:
Rivest, Ronald L.
Author:
Massachusetts Institute of Technology
Author:
Leiserson, Charles E.
Author:
Cormen, Thomas H.
Location:
Cambridge
Subject:
Computer programming
Subject:
Computer algorithms
Subject:
Programming - Algorithms
Subject:
Reference - General
Copyright:
Edition Description:
third edition
Series:
Introduction to Algorithms
Publication Date:
20090731
Binding:
Paperback
Grade Level:
Professional and scholarly
Language:
English
Illustrations:
235 band#38;w illus.
Pages:
1312
Dimensions:
9 x 8 x 1.77 in
Age Level:
from 18

Related Subjects

Computers and Internet » Software Engineering » Algorithms
Reference » Science Reference » Philosophy of Science

Introduction to Algorithms, Third Edition New Trade Paper
0 stars - 0 reviews
$104.05 In Stock
Product details 1312 pages Mit Press - English 9780262533058 Reviews:
"Synopsis" by , 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.
"Synopsis" by , andlt;Pandgt;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.andlt;/Pandgt;
"Synopsis" by , 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.
spacer
spacer
  • back to top

FOLLOW US ON...

     
Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and gifts — here at Powells.com.