6.046/18.410  Introduction to Algorithms

Fall 2004

Professor: Charles E Leiserson, Piotr Indyk

TAs: Matthew B Lepinski, David Liben-Nowell, Reina E Riemann, Bill Thies

Lecture:  MW9.30-11  (32-123)        

Information: 

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.

Announcements

Announcements are restricted to class participants. Please log in to see them.