Princeton University
Computer Science Dept.

Computer Science 521
Advanced Algorithm Design

Robert Tarjan

Fall 2000
Directory
General Information | Assignments | Solutions | Handouts | Final Exam | What's New?

Course Summary

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.

Fall Class List
NameDept.Class E-mail Address
Jie ChenCS G4 jennifer@cs.princeton.edu
Mao ChenCS G3 maoch@cs.princeton.edu
Somdip DattaELE G2 datta@princeton.edu
Edith ElkindCS G1 elkind@cs.princeton.edu
Loukas GeorgiadisCS G1 lgeorgia@cs.princeton.edu
Junwen LaiCS G1 lai@cs.princeton.edu
Ding LiuCS G2 dingliu@cs.princeton.edu
Ting LiuCS G2 tliu@cs.princeton.edu
Manij PrabhakaranCS G1 mp@cs.princeton.edu
Sumeet SobtiCS G1 sobti@cs.princeton.edu
Iannis TourlakisCS G1 itourlak@cs.princeton.edu
Tony WirthCS G1 awirth@cs.princeton.edu
Bryan WolffCS 01 blwolff@princeton.edu
Elena ZaslavskyCS G2 eoranska@cs.princeton.edu

Administrative Information

Lectures: TTh 3:00-5:20, Room: CS 302

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

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

Teaching Assistants: TBA