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.
Erik Demaine & Srini Devadas
Professors of Computer Science
Courses by Erik Demaine & Srini Devadas
Complete university lecture series taught by Erik Demaine & Srini Devadas.
All lectures by Erik Demaine & Srini Devadas
8Search or browse every recorded session across courses and talks.
Showing 8 of 8 lectures
Lecturej/k navigate · c chapters · s save · x watched
Scholar · University
Chapters · Duration
6.046J · Lec 1 · Erik Demaine & Srini Devadas · MIT
1:23:34
6.046J · Lec 4 · Erik Demaine & Srini Devadas · MIT
1:20:52
6.046J · Lec 7 · Erik Demaine & Srini Devadas · MIT
1:15:53
6.046J · Lec 6 · Erik Demaine & Srini Devadas · MIT
1:20:14
6.046J · Lec 2 · Erik Demaine & Srini Devadas · MIT
1:20:34
6.046J · Lec 8 · Erik Demaine & Srini Devadas · MIT
1:21:52
6.046J · Lec 5 · Erik Demaine & Srini Devadas · MIT
30:45
6.046J · Lec 3 · Erik Demaine & Srini Devadas · MIT
53:46