6.046J / 18.410J Introduction to Algorithms, Fall 2001
Name
6-046JFall-2001.zip
Size
7.1 MB
Format
ZIP
Checksum (MD5)
5b02aa796328f4ad323ecaae7d6b3a96
Author(s)
Demaine, Erik D.
Leiserson, Charles Eric
Lee, Wee Sun
Alternative Title
Introduction to Algorithms
Date Issued
December 2001
Abstract
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-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing. Enrollment may be limited.
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
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Persistent DSpace Link
