Publisher
Springer International Publishing
Reference41 articles.
1. Acharya, J., Orlitsky, A., Suresh, A.T., Tyagi, H.: The complexity of estimating rényi entropy. In: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1855–1869. SIAM (2014)
2. Acharya, J., Orlitsky, A., Suresh, A.T., Tyagi, H.: Estimating rényi entropy of discrete distributions. IEEE Trans. Inf. Theory 63(1), 38–56 (2016)
3. Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58(1), 137–147 (1999)
4. Batu, T., Fischer, E., Fortnow, L., Kumar, R., Rubinfeld, R., White, P.: Testing random variables for independence and identity. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 442–451. IEEE (2001)
5. Bellec, P.C.: Concentration of quadratic forms under a Bernstein moment assumption. arXiv preprint arXiv:1901.08736 (2019)