Z. Bar-yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan, Counting Distinct Elements in a Data Stream, RANDOM '02: Proceedings of the 6th International Workshop on Randomization and Approximation Techniques, pp.1-10, 2002.
DOI : 10.1007/3-540-45726-7_1

A. Broder, On the resemblance and containment of documents, Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 1997.
DOI : 10.1109/SEQUEN.1997.666900

A. Z. Broder, Identifying and Filtering Near-Duplicate Documents, COM '00: Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, pp.1-10, 2000.
DOI : 10.1007/3-540-45123-4_1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.365.5357

P. Chassaing and L. Gerin, Efficient estimation of the cardinality of large data sets Extended abstract in the proceedings of the 4th Colloquium on, math.ST/0701347, pp.419-422, 2006.

J. Considine, F. Li, G. Kollios, and J. Byers, Approximate aggregation techniques for sensor databases, Proceedings. 20th International Conference on Data Engineering, p.449, 2004.
DOI : 10.1109/ICDE.2004.1320018

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

C. Estan, G. Varghese, and M. Fisk, Bitmap Algorithms for Counting Active Flows on High-Speed Links, IEEE/ACM Transactions on Networking, vol.14, issue.5, pp.925-937, 2006.
DOI : 10.1109/TNET.2006.882836

P. Flajolet, Adaptive sampling Encyclopaedia of Mathematics, volume Supplement I, page 28, 1997.

P. Flajolet, E. Fusy, O. Gandouet, and F. Meunier, Hyperloglog: the analysis of a near-optimal cardinality estimation algorithm, Discrete Mathematics and Theoretical Computer Science Proceedings, 2007.
URL : https://hal.archives-ouvertes.fr/hal-00406166

P. Flajolet and P. N. Martin, Probabilistic counting, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983), pp.76-82, 1983.
DOI : 10.1109/SFCS.1983.46
URL : https://hal.archives-ouvertes.fr/inria-00076244

C. Fraleigh, C. Diot, B. Lyles, S. Moon, P. Owezarski et al., Design and Deployment of a Passive Monitoring Infrastructure In Passive and Active Measurement Workshop Estimating the number of active flows in a data stream over a sliding window, Proceedings of the Ninth Workshop on Algorithm Engineering and Experiments and the Fourth Workshop on Analytic Algorithmics and Combinatorics Proceedings of the New Orleans Conference, pp.223-231, 2001.

L. Getoor, B. Taskar, and D. Koller, Selectivity estimation using probabilistic models, SIGMOD Conference, 2001.

P. B. Gibbons, Distinct sampling for highly-accurate answers to distinct values queries and event reports, The VLDB Journal, pp.541-550, 2001.

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

F. Giroire, Directions to use probabilistic algorithms for cardinality for DNA analysis, Journées Ouvertes Biologie Informatique Mathématiques, pp.3-5, 2006.

F. Giroire, Réseaux, algorithmique et analyse combinatoire de grands ensembles, 2006.

G. Iannaccone, C. Diot, I. Graham, and N. Mckeown, Monitoring very high speed links, Proceedings of the First ACM SIGCOMM Workshop on Internet Measurement , IMW '01, 2001.
DOI : 10.1145/505202.505235

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

K. Whang, B. T. Zanden, and H. M. Taylor, A linear-time probabilistic counting algorithm for database applications, TODS 15, pp.208-229, 1990.
DOI : 10.1145/78922.78925