Erik Demaine

Foundational MIT algorithms course covering asymptotic complexity, divide-and-conquer, hashing, balanced search trees, graph search, shortest paths, and dynamic programming.

MIT's upper-level algorithms sequence advancing into divide-and-conquer FFT, amortized analysis, randomized algorithms, network flow, linear programming, NP-completeness, and approximation.

Persistent data structures, retroactive structures, geometric range queries, dynamic optimality, splay trees, van Emde Boas trees, fusion trees, cache-oblivious structures, and succinct representations.