Topics in Theoretical Computer Science: An Algorithmist's Toolkit

Spider web-like arrangement of connected triangles increasing in size from small in the center to large at the edges.

Handmade graph embedding for a graph used to model an airfoil. (Image by Dan Spielman. Used with permission.)


MIT Course Number


As Taught In

Fall 2009



Cite This Course

Course Description

Course Features

Course Description

This course covers a collection of geometric techniques that apply broadly in modern algorithm design.

Other Versions

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.

Archived versions: Question_avt logo

Related Content

Jonathan Kelner. 18.409 Topics in Theoretical Computer Science: An Algorithmist's Toolkit. Fall 2009. Massachusetts Institute of Technology: MIT OpenCourseWare, License: Creative Commons BY-NC-SA.

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