18.409 Topics in Theoretical Computer Science: An Algorithmist's Toolkit

Fall 2007

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

Course Description

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

Technical Requirements

Special software is required to use some of the files in this course: .ps.

Donate Now

Staff

Instructor:
Prof. Jonathan Kelner

Course Meeting Times

Lectures:
2 sessions / week
1.5 hours / session

Level

Graduate