N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, Proceedings of the 28th ACM Symposium on Theory of computing (STOC, pp.20-29, 1996.

E. Anceaume and Y. Busnel, A Distributed Information Divergence Estimation over Data Streams, IEEE Transaction on Parallel and Distributed System, vol.25, pp.478-487, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00998708

E. Anceaume and Y. Busnel, Lightweight Metric Computation for Distributed Massive Data Streams. Transaction on Large-Scale Data-and Knowledge-Centered Systems, vol.33, pp.1-39, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01634353

E. Anceaume, Y. Busnel, and S. Gambs, Uniform and Ergodic Sampling in Unstructured Peer-to-Peer Systems with Malicious Nodes, Proceedings of the 14th International Conference on Principles of Distributed Systems (OPODIS), vol.6490, pp.64-78, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00554219

E. Anceaume, Y. Busnel, and S. Gambs, An-KLe: Detecting Attacks in Large Scale Systems via Information Divergence, Proceedings of the 9th European Dependable Computing Conference (EDCC), 2012.

E. Anceaume, Y. Busnel, and N. Rivetti, Estimating the Frequency of Data Items in Massive Distributed Streams, Proceedings of the 4th IEEE Symposium on Network Cloud Computing and Applications (NCCA), pp.59-66, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01194529

E. Anceaume, Y. Busnel, N. Rivetti, and B. Sericola, Identifying Global Icebergs in Distributed Streams, Proceedings of the 34th IEEE Symposium on Reliable Distributed Systems (SRDS), pp.266-275, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01141829

R. W. Kenneth and . Brewer, A simple procedure for ?pswor, Australian Journal of Statistics, vol.17, pp.166-172, 1975.

A. Chakrabarti, G. Cormode, and A. Mcgregor, A near-optimal algorithm for computing the entropy of a stream, Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA, pp.328-335, 2007.

V. Chandola, A. Banerjee, and V. Kumar, Anomaly detection: A survey, Comput. Surveys, vol.41, pp.1-58, 2009.

M. Charikar, K. Chen, and M. Farach-colton, Finding frequent items in data streams, Computer Science, vol.312, pp.3-15, 2004.

G. Chauvet, On a characterization of ordered pivotal sampling, Bernoulli, vol.18, pp.1320-1340, 2012.

G. Chauvet and Y. Tillé, A fast algorithm of balanced sampling, Journal of Computational Statistics, vol.21, pp.9-31, 2006.

G. Cormode and S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications, Journal of Algorithms, vol.55, pp.58-75, 2005.

G. Cormode, S. Muthukrishnan, and K. Yi, Algorithms for distributed functional monitoring, Proceedings of the 19th ACM-SIAM Symposium On Discrete Algorithms (SODA), 2008.

M. Datar, A. Gionis, P. Indyk, and R. Motwani, Maintaining Stream Statistics over Sliding Windows, SIAM J. Comput, vol.31, pp.1794-1813, 2002.

J. Deville, Une nouvelle (encore une!) méthode de tirageà probabilités inégales, Méthodologie Statistique, 1998.

J. , C. Deville, and Y. Tillé, Unequal probability sampling without replacement through a splitting method, Biometrika, vol.85, pp.89-101, 1998.

J. , C. Deville, and Y. Tillé, Efficient balanced sampling: The cube method, Biometrika, vol.91, pp.893-912, 2004.

W. Fuller, Sampling with random stratum boundaries, Journal of the Royal Statistical Society, vol.32, pp.209-226, 1970.

S. Ganguly, M. Garafalakis, R. Rastogi, and K. Sabnani, Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks, Proceedings of the 27th International Conference on Distributed Computing Systems (ICDCS '07), p.4, 2007.

J. Hájek, Discussion of an essay on the logical foundations of survey sampling, 1971.

. Basu, Foundations of Statistical Inference, p.326

D. M. Kane, J. Nelson, and D. P. Woodruff, An Optimal Algorithm for the Distinct Element Problem, Proceedings of the 29th ACM Symposium on Principles of Database Systems (PODS), 2010.

V. Karamcheti, D. Geiger, Z. Kedem, and S. Muthuskrishnan, Detecting malicious network traffic using inverse distribution of packet contents, Proceedings of the 1st Workshop on Mining Network Data (MineNet), 2005.

B. Krishnamurthy, S. Sen, Y. Zhang, and Y. Chen, Sketch-based Change Detection: Methods, Evaluation, and Applications, Proceedings of the 3rd ACM SIGCOMM Internet Measurement Conference (IMC), pp.234-247, 2003.

A. Lakhina, M. Crovella, and C. Diot, Mining Anomalies Using Traffic Feature Distributions, Proceedings of the 28th ACM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM), 2005.

A. Matei and Y. Tillé, The R sampling package, Version 2.8. Université de Neuchâtel, 2016.

A. Metwally, D. , and A. E. Abbadi, Efficient Computation of Frequent and Top-k Elements in Data Streams, Proceedings of the 10th International Conference on Database Theory (ICDT), 2005.

S. Muthukrishnan, Data Streams: Algorithms and Applications, 2005.

O. Salem, S. Vaton, and A. Gravey, A scalable, efficient and informative approach for anomalybased intrusion detection systems: theory and practice, International Journal of Network Management, vol.20, pp.271-293, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00565751

Y. Tillé, Sampling Algorithms, 2006.