Title:  How to Grow Your Lower Bounds

Speaker:  Mihai Patrascu, AT&T

Abstract:

This is a reedition of a tutorial I gave at FOCS'10. I will survey the
state of the art in proving lower bounds for data structure problems
in the cell-probe model of computation.