6.851 | Spring 2012 | Graduate

Advanced Data Structures

Lecture Videos

Session 13: Integer Lower Bounds

Description: Integer data structure lower bounds. In particular, we’ll prove that the min of van Emde Boas and fusion trees is an optimal (static) predecessor data structure up to a log log factor, assuming polynomial space.

Speaker: Prof. Erik Demaine

Course Info

Instructor
As Taught In
Spring 2012
Level
Learning Resource Types
Lecture Videos
Problem Sets with Solutions
Lecture Notes
Instructor Insights