Tight lower bounds for the distinct elements problem
暂无分享,去创建一个
[1] Luca Trevisan,et al. Counting Distinct Elements in a Data Stream , 2002, RANDOM.
[2] T. Figiel,et al. The dimension of almost spherical sections of convex bodies , 1976 .
[3] Noam Nisan,et al. On Randomized One-round Communication Complexity , 1995, STOC '95.
[4] Philippe Flajolet,et al. Probabilistic Counting Algorithms for Data Base Applications , 1985, J. Comput. Syst. Sci..
[5] Srinivasan Seshan,et al. Detecting DDoS Attacks on ISP Networks , 2003 .
[6] Piotr Indyk,et al. Algorithmic applications of low-distortion geometric embeddings , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[7] Noga Alon,et al. The space complexity of approximating the frequency moments , 1996, STOC '96.
[8] Andrew C. Yao,et al. Lower bounds by probabilistic arguments , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[9] Ziv Bar-Yossef,et al. Information theory methods in communication complexity , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.
[10] David P. Woodruff. Optimal space lower bounds for all frequency moments , 2004, SODA '04.
[11] Vladimir Vapnik,et al. Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .
[12] C. Papadimitriou,et al. The complexity of massive data set computations , 2002 .