6.046J / 18.410J Introduction to Algorithms, Fall 2001
Author(s)Demaine, Erik D.; Leiserson, Charles Eric; Lee, Wee Sun
Introduction to Algorithms
MetadataShow full item record
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.
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