Behavior of Algorithms

A colored landscape chart.

A smoothed complexity landscape. (Image courtesy of Prof. Daniel Spielman.)


MIT Course Number


As Taught In

Spring 2002



Cite This Course

Course Features

Course Description

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.

Other OCW Versions

This is a graduate-level subject in Theoretical Computer Science. The content varies year to year, according to the interests of the instructor and the students.

Spielman, Daniel. 18.409 Behavior of Algorithms, Spring 2002. (MIT OpenCourseWare: Massachusetts Institute of Technology), (Accessed). License: Creative Commons BY-NC-SA

For more information about using these materials and the Creative Commons license, see our Terms of Use.