S. M. Ali and S. D. Silvey, General Class of Coefficients of Divergence of One Distribution from Another, J. of the Royal Statistical Society. Series B, vol.28, issue.1, pp.131-142, 1966.

N. Alon, Y. Matias, and M. Szegedy, The space complexity of approximating the frequency moments, Proc. of the 28th ACM STOC, pp.20-29, 1996.

S. Amari, <formula formulatype="inline"><tex Notation="TeX">$\alpha$</tex> </formula>-Divergence Is Unique, Belonging to Both <formula formulatype="inline"> <tex Notation="TeX">$f$</tex></formula>-Divergence and Bregman Divergence Classes, IEEE Transactions on Information Theory, vol.55, issue.11, pp.4925-4931, 2009.
DOI : 10.1109/TIT.2009.2030485

S. Amari and A. Cichocki, Information geometry of divergence functions. Bulletin of the Polish Academy of Sciences: Technical Sciences, pp.183-195, 2010.

E. Anceaume and Y. Busnel, An information divergence estimation over data streams, Proc. of the 11th IEEE Intl Symp. on Network Computing and Applications (NCA), 2012.
DOI : 10.1109/nca.2012.16
URL : https://hal.archives-ouvertes.fr/hal-00725097

E. Anceaume and Y. Busnel, Sketch *-Metric: Comparing Data Streams via Sketching, 2013 IEEE 12th International Symposium on Network Computing and Applications, 2012.
DOI : 10.1109/NCA.2013.11
URL : https://hal.archives-ouvertes.fr/hal-00721211

M. Basseville and J. Cardoso, On entropies, divergences, and mean values, Proceedings of 1995 IEEE International Symposium on Information Theory, 1995.
DOI : 10.1109/ISIT.1995.550317

A. Bhattacharyya, On a measure of divergence between two statistical populations defined by their probability distributions, Bul. of the Calcutta Math. Soc, vol.35, pp.99-109, 1943.

L. M. Bregman, The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming, USSR Computational Mathematics and Mathematical Physics, vol.7, issue.3, pp.200-217, 1967.
DOI : 10.1016/0041-5553(67)90040-7

A. Chakrabarti, K. D. Ba, and S. Muthukrishnan, Estimating entropy and entropy norm on data streams, Proc. of the 23rd Intl STACS, 2006.
DOI : 10.1080/15427951.2006.10129117
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.331

M. Charikar, K. Chen, and M. Farach-colton, Finding frequent items in data streams, Theoretical Computer Science, vol.312, issue.1, pp.3-15, 2004.
DOI : 10.1016/S0304-3975(03)00400-6

G. Cormode and M. Garofalakis, Sketching probabilistic data streams, Proceedings of the 2007 ACM SIGMOD international conference on Management of data , SIGMOD '07, pp.281-292, 2007.
DOI : 10.1145/1247480.1247513

G. Cormode and S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications, Journal of Algorithms, vol.55, issue.1, pp.58-75, 2005.
DOI : 10.1016/j.jalgor.2003.12.001
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.9395

T. Cover and J. Thomas, Elements of information theory, 1991.
DOI : 10.1002/047174882x

I. Csiszár, Information Measures: A Critical Survey, Transactions of the Seventh Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, pp.73-86, 1978.

I. Csiszár, Why Least Squares and Maximum Entropy? An Axiomatic Approach to Inference for Linear Inverse Problems, The Annals of Statistics, vol.19, issue.4, pp.2032-2066, 1991.
DOI : 10.1214/aos/1176348385

S. Guha, P. Indyk, and A. Mcgregor, Sketching information divergences, Machine Learning, pp.5-19, 2008.
DOI : 10.1007/s10994-008-5054-x
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.90.3956

S. Guha, A. Mcgregor, and S. Venkatasubramanian, Streaming and sublinear approximation of entropy and information distances, Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm , SODA '06, pp.733-742, 2006.
DOI : 10.1145/1109557.1109637

S. Kullback and R. A. Leibler, On Information and Sufficiency, The Annals of Mathematical Statistics, vol.22, issue.1, pp.79-86, 1951.
DOI : 10.1214/aoms/1177729694

A. Lakhina, M. Crovella, and C. Diot, Mining anomalies using traffic feature distributions, Proc. of the ACM Conference on Applications, technologies, architectures, and protocols for computer communications (SIGCOMM), 2005.
DOI : 10.1145/1080091.1080118
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.116.4156

A. Lall, V. Sekar, M. Ogihara, J. Xu, and H. Zhang, Data streaming algorithms for estimating entropy of network traffic, Proc. of the SIGMETRICS, 2006.

T. Morimoto, -Theorem, Journal of the Physical Society of Japan, vol.18, issue.3, pp.328-331, 1963.
DOI : 10.1143/JPSJ.18.328
URL : https://hal.archives-ouvertes.fr/hal-00658784

. Muthukrishnan, Data Streams: Algorithms and Applications, Foundations and Trends?? in Theoretical Computer Science, vol.1, issue.2, 2005.
DOI : 10.1561/0400000002
URL : http://ce.sharif.edu/courses/90-91/1/ce797-1/resources/root/Data_Streams_-_Algorithms_and_Applications.pdf