Name: Session 13: Integer Lower Bounds
Uploaded: 2013-12-18T17:25:23Z
Duration: 1 h 22 min 10 s
Description: 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

1:22:10

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