What Can’t We Compute on Data Streams?

Date

May 24, 2013

Speaker

Amit Chakrabarti

Affiliation

Dartmouth

Overview

I will survey—at a very high level—the landscape of known space lower bounds for data stream computation and the crucial ideas, mostly from communication complexity, used to obtain these bounds. The survey will necessarily be biased towards results that I consider to be the best broad introduction. Later, I will outline a few basic problems where tight lower bounds are not known yet, so that improvements to known algorithms are possible.