A. Noga-alon, T. Andoni, K. Kaufman, R. Matulef, N. Rubinfeld et al., Testing k-wise and almost k-wise independence, STOC '07: Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, pp.496-505, 2007.

L. Noga-alon, A. Babai, and . Itai, A fast and simple randomized parallel algorithm for the maximal independent set problem, Journal of Algorithms, vol.7, issue.4, pp.567-583, 1986.
DOI : 10.1016/0196-6774(86)90019-2

O. Noga-alon, Y. Goldreich, and . Mansour, Almost k-wise independence versus k-wise independence, Information Processing Letters, vol.88, issue.3, pp.107-110, 2003.
DOI : 10.1016/S0020-0190(03)00359-4

Y. Noga-alon, M. Matias, and . Szegedy, The Space Complexity of Approximating the Frequency Moments, Journal of Computer and System Sciences, vol.58, issue.1, pp.137-147, 1999.
DOI : 10.1006/jcss.1997.1545

T. Batu, L. Fortnow, E. Fischer, R. Kumar, R. Rubinfeld et al., Testing random variables for independence and identity, Proceedings 2001 IEEE International Conference on Cluster Computing, p.442, 2001.
DOI : 10.1109/SFCS.2001.959920

T. Batu, R. Kumar, and R. Rubinfeld, Sublinear algorithms for testing monotone and unimodal distributions, Proceedings of the thirty-sixth annual ACM symposium on Theory of computing , STOC '04, pp.381-390, 2004.
DOI : 10.1145/1007352.1007414

V. Braverman and R. Ostrovsky, Measuring $k$-wise independence of streaming data. CoRR, abs/0806, pp.4790-4791, 2008.

V. Braverman and R. Ostrovsky, Measuring independence of datasets. CoRR, 2009.

V. Braverman and R. Ostrovsky, AMS without 4-wise independence on product domains. CoRR, abs/0806, pp.4790-4793, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00455776

K. Chung, Z. Liu, and M. Mitzenmacher, Testing k-wise independence over streaming data. Unpublished manuscript, 2009.

O. Goldreich and D. Ron, On Testing Expansion in Bounded-Degree Graphs, Electronic Colloquium on Computational Complexity, vol.59, issue.2, 2000.
DOI : 10.1002/0471722154

P. Indyk and A. Mcgregor, Declaring independence via the sketching of sketches, SODA '08: Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pp.737-745, 2008.

M. Mitzenmacher and E. Upfal, Probability and Computing: Randomized Algorithms and Probabilistic Analysis, 2005.
DOI : 10.1017/CBO9780511813603

R. Rubinfeld and R. A. Servedio, Testing monotone high-dimensional distributions, STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing, pp.147-156, 2005.
DOI : 10.1145/1060590.1060613
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.1050

M. Thorup and Y. Zhang, Tabulation based 4-universal hashing with applications to second moment estimation, SODA '04: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp.615-624, 2004.