Princeton University
Computer Science Department

Computer Science 423
Theory of Algorithms

Robert Tarjan

Spring 2006


Directory
General Information

Course Summary


Administrative Information

Lectures: MW 11:00-12:20, Room: Friend Center 004, Office Hours: MW 12:30-2 and By Appt

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

Secretary: Mitra Kelly - 323 CS Building - 258-4562 mkelly@cs.princeton.edu

Teaching Assistants: Janek Klawe - 316 CS Building - 258-5386 jklawe@cs.princeton.edu, Office Hours: M 8:00-9:00 PM, Th 5:00-6:00 PM

Precept classes: in small auditorium 105, Tuesdays from 4:30-5:30pm


Problem Sets
Problem Set 1
Problem Set 2
Problem Set 2 Addendum
Problem Set 3
Problem Set 4
Problem Set 5
Problem Set 6

Handouts
Course Information
Complexity of Combinatorial Algorithms
Amortized Comp.Complexity
Notes on Heapsort..
Amortize
Shortest Path Problem
Disjoint Set union 1
Disjoint Set Union 2
Fibonacci Heaps
Splay Trees
Binary Search Trees
Shortest Paths
Maximum Network Flow
Minimum-Cost...
Self-Adjusting Binary...
Dynamic Trees
Computing Point to Point
Efficient Point to Point-Reach For A
Computing Shortest Path
EPP Shortest Path Algorithms
Efficient ALGORITHMS (Plus cartoons)
Reductions
Peculiar Problems
Vertex Cover
How to Multiply