1. An Optimal Algorithm for the Distinct Elements Problem Inspired by [Bar-Yossef et al. 2002] 11724 17 9 2 5 1 1 4 6 1/ε2 1 2 3 h:{1,…,n} {1,…,log n} 4 Pr[h(i) = j] = 1/2j … 5 … log n 4 3 4 3 4 5 2 g:{1,…,n} {1,…,1/ε2} MIT Computer Science and Artificial Intelligence Laboratory, Theory of Computation Group