Princeton University
Computer Science Dept.

Computer Science 423
Theory of Algorithms

Robert E. Tarjan

Spring 1999
Directory
General Information | Assignments | Solutions | Handouts | Schedule | Final Exam | What's New?

Course Summary

An introduction to NP-completeness and intractability. Models of computation. Lower bounding techniques. Advanced algorithms selected for their practical and aesthetic interest. Prerequisites: 226 and 341.

Administrative Information

Lectures: TTh 10:30-11:50, Room: 104 CS Building

Professor: Robert E. Tarjan - 324 CS Building - 258-4797 ret@cs.princeton.edu

Undergraduate Coordinator: Tina McCoy - 410 CS Building - 258-1746 tmhill@cs.princeton.edu

Teaching Assistants:
Wai Fun Lee room 214 (258-1793) Office hours: Tuesday 2:00 -- 3:00
Amit Chakrabarti room 313 (258-6126) Office hours: Monday 3:00 -- 4:00