Finding top k items  and finding heavy hitters in data streams are two well studied problems in streaming algorithms. We shall discuss two deterministic streaming algorithms, one for each of these two problems.

We consider two different models for adversarial errors and show how to design circuits that can recover from such errors.