Ronitt Rubinfeld: Local Computation Algorithms

Tuesday, November 1, 2016 - 4:00pm to 5:00pm
Light Refreshments at 3:50pm
Patil/Kiva G449
Ronitt Rubenfeld, MIT


Consider a setting in which inputs to and outputs from a computational
problem are so large, that there is not time to read them in their
entirety.   However, if one is only interested in small parts of the
output at any given time, is it really necessary to solve the entire
computational problem? Is it even necessary to view the whole input?
We survey recent work in the model of {\em local computation algorithms}
which for a given input, supports queries by a user to values of specified bits
of a legal output.  The goal is to design local computation algorithms
in such a way that very little of the input needs to be seen in order
to determine the value of any single bit of the output.
In this talk, we survey results on a variety of problems for which sublinear time
and space local computation algorithms have been developed -- we will
give special focus to finding  maximal independent sets and sparse spanning graphs.