6.854J | Fall 2008 | Graduate

Advanced Algorithms

Study Materials

Lecture 15

Description:

Lecture notes on running time analysis of dynamic trees, using dynamic trees to implement cancel and tighten efficiently, correctness, and running time.

Course Info

Fall 2008
Lecture Notes
Problem Set Solutions
Problem Sets