Y. Noga-alon, M. Matias, and . Szegedy, The space complexity of approximating the frequency moments, 28th ACM Symp. on Theory of Computing, pp.20-29, 1996.

N. B. Azzouna, C. Fricker, and F. Guillemin, Modeling ADSL traffic on an IP backbone link, Annals of Telecommunications, vol.59, pp.11-12, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00071671

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

O. Gandouet and A. Jean-marie, LogLog counting for the estimation of IP traffic, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01184707

I. Kremer, N. Nissan, and D. Ron, On randomized one-round communication complexity, Proc. STOCS'95, pp.596-605, 1995.

E. Kushilevitz and N. Nisan, Communication Complexity, 1996.

A. Lall, V. Sekar, M. Ogihara, J. Xu, and H. Zhang, Data streaming algorithms for estimating entropy of network traffic, Proc. SIGMETRICS/PERFORMANCE'06, pp.145-156, 2006.

K. Levchensko, R. Paturi, and G. Varghese, On the difficulty of scalably detecting network attacks. Computers and Communication Security, p.25, 2004.

M. Saks and X. Sun, Space lower bounds for distance approximation in the data stream model, Proceedings of the thiry-fourth annual ACM symposium on Theory of computing , STOC '02, pp.360-369, 2002.
DOI : 10.1145/509907.509963

A. Yao, Some complexity questions related to distributive computing, 11th ACM STOC, pp.209-213, 1979.