T. Yossef, R. Jayram, D. Kumar, L. Sivakumar, and . Trevisan, Counting distinct elements in a data stream, 2002.

M. Durand and P. Flajolet, Loglog Counting of Large Cardinalities, 11th Annual European Symposium on Algorithms (ESA03), 1993.
DOI : 10.1007/978-3-540-39658-1_55

W. Feller, An Introduction to Probability Theory and its Applications, 1970.

P. Flajolet, Counting by Coin Tossings, pp.1-12, 2004.
DOI : 10.1007/978-3-540-30502-6_1

P. Flajolet and N. Martin, Probabilistic counting algorithms for data base applications, Journal of Computer and System Sciences, vol.31, issue.2, pp.182-209, 1985.
DOI : 10.1016/0022-0000(85)90041-8
URL : https://hal.archives-ouvertes.fr/inria-00076244

F. Giroire, Order statistics and estimating cardinalities of massive data sets, DMTCS proceedings, International Conference on Analysis of Algorithms, pp.157-166, 2005.
DOI : 10.1016/j.dam.2008.06.020
URL : https://hal.archives-ouvertes.fr/hal-01184025

D. [. Indyk and . Woodruff, Tight lower bounds for the distinct elements problem, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.283-290, 2003.
DOI : 10.1109/SFCS.2003.1238202

D. Knuth, Sorting and Searching, The Art of Computer Programming, vol.3, 1973.

]. E. Leh83 and . Lehmann, Theory of Point Estimation, 1983.

N. [. Matias, M. Alon, and . Szegedy, The space complexity of approximating the frequency moments, Proceedings of the 28th ACM Symp. on Theory of Computing, pp.20-29, 1996.