13. Integer Lower Bounds

From the creator

MIT 6.851 Advanced Data Structures, Spring 2012 View the complete course: http://ocw.mit.edu/6-851S12 Instructor: Erik Demaine 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. License: Creative Commons BY-NC-SA More information at http://ocw.mit.edu/terms More courses at http://ocw.mit.edu

Published 2013-12-18 · Watch on YouTube ↗
Availability and playback restrictions are controlled by the original channel.