Prof. Erik Demaine
Prof. Srinivas Devadas
Prof. Nancy Lynch
6.046J / 18.410J
This is an intermediate algorithms course with an emphasis on teaching techniques for the design and analysis of efficient algorithms, emphasizing methods of application. Topics include divide-and-conquer, randomization, dynamic programming, greedy algorithms, incremental improvement, complexity, and cryptography.
The Spring 2015 version of 6.046 contains substantially different content than the Spring 2005 version. The 2005 version was an introductory algorithms course assuming minimal previous experience, while the 2015 version is an intermediate course requiring a semester of introductory material found in 6.006.
OCW has published multiple versions of this subject.
Erik Demaine, Srinivas Devadas, and Nancy Lynch. 6.046J Design and Analysis of Algorithms, Spring 2015. (Massachusetts Institute of Technology: MIT OpenCourseWare), http://ocw.mit.edu (Accessed). License: Creative Commons BY-NC-SA