Sublinear Algorithms for Approximating String Compressibility and the Distribution Support Size
暂无分享,去创建一个
[1] Ronitt Rubinfeld,et al. The complexity of approximating entropy , 2002, STOC '02.
[2] C. Papadimitriou,et al. The complexity of massive data set computations , 2002 .
[3] Rajeev Motwani,et al. Towards estimation error guarantees for distinct values , 2000, PODS '00.
[4] Michael Weba. Bounds for the total variation distance between the binomial and the poisson distribution in case of medium-sized success probabilities , 1999 .
[5] Alex Samorodnitsky,et al. Approximating the entropy of large alphabets , 2005, Electron. Colloquium Comput. Complex..
[6] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[7] Abraham Lempel,et al. A universal algorithm for sequential data compression , 1977, IEEE Trans. Inf. Theory.
[8] Ravi Kumar,et al. Sampling algorithms: lower bounds and applications , 2001, STOC '01.
[9] Thomas M. Cover,et al. Elements of Information Theory , 2005 .
[10] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.