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

Learning Resource Types

theaters Lecture Videos
assignment_turned_in Problem Sets with Solutions
notes Lecture Notes
co_present Instructor Insights