<--- Back to Details
First PageDocument Content
Analysis of algorithms / Probabilistic complexity theory / Randomized algorithm
Date: 2015-01-19 07:51:43
Analysis of algorithms
Probabilistic complexity theory
Randomized algorithm

 Exercise 1 (A streaming algorithm for counting the number of distinct values). [⋆] We are given a stream of numbers x1 , . . . , xn ∈ [m] and we want to compute the number of distinct values in the stream: F0 (x) =

Add to Reading List

Source URL: www.liafa.univ-paris-diderot.fr

Download Document from Source Website

File Size: 90,30 KB

Share Document on Facebook

Similar Documents