Prof. Daniel Spielman
This course is a study of Behavior of Algorithms and covers an area of current interest in theoretical computer science. The topics vary from term to term. During this term, we discuss rigorous approaches to explaining the typical performance of algorithms with a focus on the following approaches: smoothed analysis, condition numbers/parametric analysis, and subclassing inputs.
Spielman, Daniel. 18.409 Behavior of Algorithms, Spring 2002. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-409-behavior-of-algorithms-spring-2002 (Accessed). License: Creative Commons BY-NC-SA