Princeton University
Computer Science Dept.

Computer Science 593
Advanced Topics in the Theory of Algorithms: Advanced Algorithm Design

Bernard Chazelle

Fall 1999
Directory
General Information | Assignments | Solutions | Handouts |
Slides 1 -- 30 | 31 -- 64 | 65 -- 84 | 85 -- 100 | 101 -- 134 |
Final Exam | What's New?

Course Summary

This course will cover advanced methods of algorithmic design and analysis: data structures, network flows, and linear programming. Solution of linear programs: Karmarkar and Ellipsoid algorithms. Probabilistic techniques. A selection of topics from on-line computation, approximation algorithms for NP-hard problems, number theoretic algorithms, geometric algorithms, and parallel computation.

Course Syllabus

Slides 1-30

Slides 31 - 64

Slides 65 - 84

Slides 85 - 100

Slides 101 - 134

Administrative Information

Lectures: TTh 3:00-4:20, Room: TBA

Professor: Bernard Chazelle - 404 CS Building - 258-5380 chazelle@cs.princeton.edu

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

Teaching Assistants: