6.046J / 18.410J Introduction to Algorithms, Fall 2001

6.046J / 18.410J Introduction to Algorithms, Fall 2001

Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics: sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; amortized analysis; graph algorithms; shortest paths; network flow; computational geometry; number-theor...

Full description

Bibliographic Details
Main Authors: Demaine, Erik D., Leiserson, Charles Eric, Lee, Wee Sun
Language:en-US
Published: 2001
Subjects:
algorithms
efficient algorithms
sorting
search trees
heaps
hashing
divide-and-conquer
dynamic programming
amortized analysis
graph algorithms
shortest paths
network flow
computational geometry
number-theoretic algorithms
polynomial and matrix calculations
caching
parallel computing
6.046J
18.410J
6.046
18.410
Algorithms
Online Access:http://hdl.handle.net/1721.1/36847

Internet

http://hdl.handle.net/1721.1/36847

Similar Items