Princeton University
Computer Science Department

Computer Science 423
Theory of Algorithms

Robert Tarjan

Spring 2014


COURSE INFORMATION | LECTURES | ASSIGNMENTS


The following schedule is tentative and may change throughout the semester.

DATE LECTURE READING
2/10 Shortest Paths

Lecture Slides

2/12 Shortest Paths II

Lecture Slides

2/17 Heaps

Lecture Slides

2/19 Amortized Efficiency

Lecture Slides

2/24 Minimum Spanning Trees

Lecture Slides

2/26 Minimum Spanning Trees II

Lecture Slides

3/3 Disjoint Set Union

Lecture Slides