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.)

Instructor(s)

MIT Course Number

18.409

As Taught In

Fall 2009

Level

Graduate

Cite This Course

Course Features

Course Description

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

Archived Versions

Kelner, Jonathan. 18.409 Topics in Theoretical Computer Science: An Algorithmist's Toolkit, Fall 2009. (MIT OpenCourseWare: Massachusetts Institute of Technology), http://ocw.mit.edu/courses/mathematics/18-409-topics-in-theoretical-computer-science-an-algorithmists-toolkit-fall-2009 (Accessed). License: Creative Commons BY-NC-SA


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


Close