Behavior of Algorithms

18.409 · Mathematics · Graduate · Spring 2002

Prof. Daniel Spielman

MIT · Tier 1

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.

MathematicsComputer ScienceEngineeringAlgorithms and Data StructuresData Science, Analytics & Computer TechnologyScience & Math

The syllabus, on MIT OpenCourseWare

The full course — syllabus, assigned readings, problem sets, exams, and lecture notes — lives on OCW. These open the real thing:

Syllabus ↗

Course overview, grading, schedule

Readings ↗

The assigned reading list, session by session

Assignments ↗

Problem sets and projects

Full course on OCW ↗

Everything, including lecture materials

Attribution

Prof. Daniel Spielman. 18.409 Behavior of Algorithms. Spring 2002. Massachusetts Institute of Technology: MIT OpenCourseWare, https://ocw.mit.edu. License: CC BY-NC-SA 4.0.

Course materials are © their authors and licensed CC BY-NC-SA 4.0. CurrMana links to the source and does not re-host them.