Design and Analysis of Algorithms
MIT's upper-level algorithms sequence advancing into divide-and-conquer FFT, amortized analysis, randomized algorithms, network flow, linear programming, NP-completeness, and approximation.
Professor
Complete university lecture series taught by Srinivas Devadas.
MIT's upper-level algorithms sequence advancing into divide-and-conquer FFT, amortized analysis, randomized algorithms, network flow, linear programming, NP-completeness, and approximation.
Search or browse every recorded session across courses and talks.