Optimal Space Lower Bounds for all Frequency Moments

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 160-168

  Woodruff, David ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FREQUENCY MOMENTS; OPTIMAL SPACE;

ALGORITHMS; APPROXIMATION THEORY; COMMUNICATION; DATABASE SYSTEMS; ERROR ANALYSIS; GRAPH THEORY; INTEGER PROGRAMMING; INTERNET; OPTIMIZATION; PROBABILITY; ROUTERS;

COMPUTATIONAL METHODS;

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

References (15)

1. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. In Proceedings of the 28th Annual ACM Symposum on the Theory of Computing, p. 20-29, 1996.
2. N. Alon and J. Spencer. The Probabilistic Method, Wiley Interscience, New York, 1992, 86-87.
3. Z. Bar Yossef, T.S. Jayram, R. Kumar, D. Sivakumar, and Luca Trevisan. Counting distinct elements in a data stream. RAN-DOM 2002, 6th. International Workshop on Randomization and Approximation Techniques in Computer Science, p. 1-10, 2002.
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, and D. Sivakumar. Information statistics approach to data stream and communication complexity. Foundations of Computer Science, p.209-218, 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. C. Cormode, M. Datar, P. Indyk, and M. Muthukrishnan. Comparing Data Streams Using Hamming Norms. 28th International Conference on Very Large Databases (VLDB), 2002.
8. D.J. DeWitt, J.F. Naughton, D.A. Schneider, and S. Seshadri. Practical Skew Handling in Parallel Joins. Proc. of the 18th Int'l Conf. Very Large Data Bases, p. 27, 1992.
9. P. Flajolet and G.N. Martin. Probabilistic Counting Algorithms for Data Base Applications. Journal of Computer and System Sciences, 18(2) 143-154, 1979.
10. I.J. Good. Surprise Indexes and P-values. Journal of Statistical Computation and Simulation 32, p 90-92, 1989.
11. P. Indyk and D. Woodruff. Tight Lower Bounds for the Distinct Elements Problem. To appear: Foundations of Computer Science, 2003. Available: http://web.mit.edu/dpwood/www
12. I. Kremer, N. Nisan, and D. Ron. On randomized one-round communication complexity. Computational Complexity, 8(1):21-49, 1999.
13. B.D. McKay, I.M. Wanless, and N.C. Wormald. Asymptotic enumeration of graphs with a given upper bound on the maximum degree, Combinatorics, Probability and Computing 11 p. 373-392, 2002.
14. V.N. Vapnik and A.Y. Chervonenkis. On the uniform converges of relative frequences of events to their probabilities. Theory of Probability and its Applications, XVI(2):264-280, 1971.
15. 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.