Introduction to Algorithms, third edition

Framhlið kápu
MIT Press, 31. júl. 2009 - 1312 síður
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.

 

Efni

Introduction
147
9
201
Introduction
229
Hash Tables
253
RedBlack Trees
308
Augmenting Data Structures
339
Introduction
357
Greedy Algorithms
414
Maximum Flow
708
Introduction
769
Matrix Operations
813
Linear Programming
843
Polynomials and the FFT
898
NumberTheoretic Algorithms
926
String Matching
985
Computational Geometry
1014

Amortized Analysis
451
Introduction
481
Fibonacci Heaps
505
van Emde Boas Trees
531
Data Structures for Disjoint Sets
561
Introduction
587
Minimum Spanning Trees
624
AllPairs Shortest Paths
684
NPCompleteness
1048
Approximation Algorithms
1106
Introduction
1143
C
1174
Matrices
1217
Bibliography
1255
Höfundarréttur

Aðrar útgáfur - View all

Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein
Takmarkað sýnishorn - 2009
Introduction to Algorithms, third edition
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,Clifford Stein
Engin sýnishorn í boði - 2009
Introduction to Algorithms
Thomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest
Engin sýnishorn í boði - 1990

Common terms and phrases

amortized cost analysis array assume asymptotic attribute B-tree binary search tree Chapter compute constant constraints contains data structure define delete denote depth-first search directed graph dynamic edge element equation example Exercise Fibonacci heap Figure flow network given graph G hash function hash table implement input insertion sort integer iteration Lemma linear program linked list loop invariant loop of lines matrix maximum flow merge sort method minimum spanning tree modulo multiplication multithreaded negative-weight cycle node nonnegative notation O(lgn objective value operations optimal solution optimal substructure parallel partition perform permutation pointer polynomial problem procedure Proof prove pseudocode queue quicksort random recursive call red-black tree relabel Section sequence shortest path Show simple path SIMPLEX slack form solve stack stored subarray subproblems subtree Suppose takes Theorem tion upper bound variables vertex vertices weight worst-case running x.key x₁

Um höfundinn (2009)

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.

Bókfræðilegar upplýsingar

TitillIntroduction to Algorithms, third edition
Computer science
Online access with purchase: ebrary
The MIT Press
AuthorsThomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Editionillustrated, reprint
ÚtgefandiMIT Press, 2009
ISBN0262033844, 9780262033848
Length1312 síður
  
Export CitationBiBTeX EndNote RefMan