Tight lower bounds for the distinct elements problem

Annual Symposium on Foundations of Computer Science - Proceedings

Volumn , Issue , 2003, Pages 283-288

  Indyk, Piotr ^a   Woodruff, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; BOOLEAN FUNCTIONS; DATABASE SYSTEMS;

DISTINCT ELEMENTS PROBLEM; LOWER BOUNDS; SPACE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 0344118883     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (13)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, p. 20-29, 1996.
2. N. Alon, Y. Matias, and M. Szegedy. J. Comp. Sys. Sci. 58 (1999), 137-147.
3. A. Akella, A. R. Bharambe, M. Reiter, and S. Seshan. Detecting DDoS attacks on ISP networks. In Proceedings of the Workshop on Management and Processing of Data Streams, 2003.
4. Z. Bar Yossef. The complexity of massive data set computations. Ph.D. Thesis, U.C. Berkeley, 2002.
5. Z. Bar Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, and Luca Trevisan. Counting distinct elements in a data stream. RANDOM 2002, 6th. International Workshop on Randomization and Approximation Techniques in Computer Science, p. 1-10, 2002.
6. Z. Bar Yossef, T.S. Jayram, R. Kumar, and D. Sivakumar. Information Theory Methods in Communication Complexity. 17th IEEE Annual Conference on Computational Complexity, p. 93-102, 2002.
7. T. Figiel, J. Lindenstrauss, and V. D. Milman. The Dimension of Almost Spherical Sections of Convex Bodies. Acta Mathematica (13) 53-94, 1977.
8. P. Flajolet, and G.N. Martin. Probabilistic counting algorithms for data base applications. Journal of Computer and System Sciences, 18(2) 143-154, 1979.
9. P. Indyk. Algorithmic applications of low-distortion geometric embeddings. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science, invited talk, Las Vegas, Nevada, 14-17 October, 2001.
10. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
11. V.N. Vapnik, and A.Y. Chervonenkis. On the uniform converges of relative frequencies of events to their probabilities. Theory of Probability and its Applications, XVI(2):264-280, 1971.
12. D. P. Woodruff. Optimal space lower bounds for all frequency moments. Available: http://web.mit.edu/dpwood/www
13. A. C-C. Yao. Lower bounds by probabilistic arguments. In Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, p. 420-428, 1983.