N. Alon, Y. Matias, and M. 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

Z. Bar-yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, Information theory methods in communication complexity, Proceedings 17th IEEE Annual Conference on Computational Complexity, pp.93-102, 2002.
DOI : 10.1109/CCC.2002.1004344
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.789

Z. Bar-yossef, T. S. Jayram, R. Kumar, and D. Sivakumar, An information statistics approach to data stream and communication complexity, Journal of Computer and System Sciences, vol.68, issue.4, pp.702-732, 2004.
DOI : 10.1016/j.jcss.2003.11.006

A. Chakrabarti, S. Khot, and X. Sun, Near-optimal lower bounds on the multi-party communication complexity of set disjointness, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings., pp.107-117, 2003.
DOI : 10.1109/CCC.2003.1214414

A. Chakrabarti, Y. Shi, A. Wirth, and A. C. Yao, Informational complexity and the direct sum problem for simultaneous message complexity, Proceedings 2001 IEEE International Conference on Cluster Computing, pp.270-278, 2001.
DOI : 10.1109/SFCS.2001.959901

T. M. Cover and J. A. Thomas, Elements of Information Theory, 1991.

A. L. Gibbs and F. E. Su, On Choosing and Bounding Probability Metrics, International Statistical Review, vol.28, issue.2, p.419, 2002.
DOI : 10.1111/j.1751-5823.2002.tb00178.x
URL : http://arxiv.org/abs/math/0209021

S. Kullback, A lower bound for discrimination information in terms of variation, IEEE Trans. Inform. Theory, vol.4, pp.126-127, 1967.

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

A. C. Yao, Some complexity questions related to distributive computing(Preliminary Report), Proceedings of the eleventh annual ACM symposium on Theory of computing , STOC '79, pp.209-213, 1979.
DOI : 10.1145/800135.804414