Posted by: atri | April 21, 2010

## Lecture 39: Data stream algorithms

In Monday’s lecture, we first saw how the Guruswami-Sudan algorithm can solve the more general problem of list recovery. Then we looked at data stream algorithms: in particular, we considered the problem of top-$k$ or finding the “hot items.”

In today’s lecture, we will see a connection between the hot items problem and group testing.

Addendum (4/23): Here is a very nice survey on data stream algorithm by Muthukrishnan.