6.854J | Fall 2008 | Graduate

Advanced Algorithms

Study Materials

Lecture 15


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

Course Info

As Taught In
Fall 2008
Learning Resource Types
Lecture Notes
Problem Sets with Solutions