MIT OpenCourseWare
  • OCW home
  • Course List
  • about OCW
  • Help
  • Feedback
  • Support MIT OCW

18.409 Behavior of Algorithms, Spring 2002

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

Highlights of this Course

This course features lecture notes that summarize the topics discussed and analyzed in class, as well as MATLAB® code that is presented for better understanding of the course materials.

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.


Technical Requirements

MATLAB® software is required to view and run the .m and .mat files found on this course site.

 

Staff

Instructor:
Prof. Daniel Spielman

Course Meeting Times

Lectures:
Two sessions / week
1.5 hours / session

Level

Graduate

Feedback

Send feedback about OCW or this course.