6.1220J/18.410J Design & Analysis of Algorithms
Repeats every week every Tuesday and every Thursday until Tue May 13 2025 except Tue Feb 18 2025, Tue Mar 25 2025, Thu Mar 27 2025.
Tue, 02/04/2025 - 11:00am to 12:30pmLocation:
32-123
Instructor:
Piotr Indyk, Jonathan Kelner, Srinivasan Raghuraman
Techniques for the design and analysis of efficient algorithms, emphasizing methods useful in practice. Topics include sorting; search trees, heaps, and hashing; divide-and-conquer; dynamic programming; greedy algorithms; amortized analysis; graph algorithms; and shortest paths. Advanced topics may include network flow; computational geometry; number-theoretic algorithms; polynomial and matrix calculations; caching; and parallel computing.