The Good, the Bad, and the Hungry Sale
 
 

Recently Viewed clear list


Original Essays | July 24, 2014

Jessica Valenti: IMG Full Frontal Feminism Revisited



It is arguably the worst and best time to be a feminist. In the years since I first wrote Full Frontal Feminism, we've seen a huge cultural shift in... Continue »
  1. $11.90 Sale Trade Paper add to wish list

spacer
Qualifying orders ship free.
$111.75
New Hardcover
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Qty Store Section
23 Local Warehouse Software Engineering- Algorithms

This title in other editions

Introduction to Algorithms

by

Introduction to Algorithms Cover

ISBN13: 9780262033848
ISBN10: 0262033844
Condition:
All Product Details

 

Synopses & Reviews

Publisher Comments:

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.

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:

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:

Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor.

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.

What Our Readers Are Saying

Add a comment for a chance to win!
Average customer rating based on 1 comment:

Gerry, July 25, 2012 (view all comments by Gerry)
I am currently a PhD student in Computer Science and have used this book for two advanced courses and will be using it to teach an undergraduate course this fall. I have been teaching on the college level for more than twenty years and I can honestly say I've never run into a book quite like this one (fondly referred to as "CLR"). This book is both a great reference book and a wonderful textbook. I used it to teach myself the introductory level algorithms class.

Unlike most advanced books, this book is easy to read and understand. The examples are clear, the algorithms presented are easy to follow, and the expanded explanations of the algorithms are excellent. The algorithms are presented so clearly that the "CLR" style of algorithms is standard for some ComSci publications.

I would recommend this book to anyone seriously interested in algorithms regardless of their programming skill (or lack of it) and regardless of their background in algorithms.

And what is more, some of it is really fun.
Was this comment helpful? | Yes | No
(1 of 1 readers found this comment helpful)

Product Details

ISBN:
9780262033848
Author:
Cormen, Thomas H.
Publisher:
The MIT Press
Author:
Rivest, Ronald L.
Author:
Massachusetts Institute of Technology
Author:
Leiserson, Charles E.
Author:
Stein, Clifford
Location:
Cambridge
Subject:
Computer programming
Subject:
Computer algorithms
Subject:
Programming - Algorithms
Subject:
Reference - General
Subject:
Software Engineering-Algorithms
Copyright:
Edition Description:
third edition
Series:
Introduction to Algorithms
Publication Date:
20090731
Binding:
Hardback
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

Other books you might like

  1. Business and Administrative... Used Hardcover $113.00
  2. Process Dynamics, Modeling, and... New Hardcover $197.25
  3. Microeconomics and Behavior Used Trade Paper $5.95
  4. Aerodynamics, Aeronautics, and... New Trade Paper $205.25

Related Subjects

Computers and Internet » Computers Reference » Beginning and Reference
Computers and Internet » Software Engineering » Algorithms
Reference » Science Reference » Philosophy of Science
Science and Mathematics » Environmental Studies » General
Science and Mathematics » Mathematics » Advanced
Textbooks » General

Introduction to Algorithms New Hardcover
0 stars - 0 reviews
$111.75 In Stock
Product details 1312 pages Mit Press - English 9780262033848 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 , 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" by , Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor.
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.