Strong lower bounds for approximating distribution support size and the distinct elements problem

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn , Issue , 2007, Pages 559-569

  Raskhodnikova, Sofya ^a,b   Ron, Dana ^c   Shpilka, Amir ^d   Smith, Adam ^a,b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c TEL AVIV UNIVERSITY   (Israel)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS; COMPUTER SCIENCE; CONTROL THEORY; FIBER OPTIC CHEMICAL SENSORS; FOOD ADDITIVES; FOUNDATIONS; MILITARY DATA PROCESSING; PROBABILITY DISTRIBUTIONS; RANDOM VARIABLES;

DISTINCT ELEMENTS; LOWER BOUNDS; POSITIVE INTEGERS; QUERY COMPLEXITY;

SIZE DISTRIBUTION;

EID: 46749118848     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FOCS.2007.4389525     Document Type: Conference Paper

References (18)

1. 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.
2. N. Alon, Y. Matias, and M. Szegedy. The space complexity of approximating the frequency moments. J. Comput. Syst. Sci., 58(1):137-147, 1999.
3. Z. Bar-Yossef. The complexity of Massive Data Set Computations. PhD thesis, Computer Science Division, U.C. Berkeley, 2002.
4. Z. Bar-Yossef, R. Kumar, and D. Sivakumar. Sampling algorithms: lower bounds and applications. In Proceedings of STOC, pages 266-275, New York, NY, USA, 2001. ACM Press.
5. T. Batu, S. Dasgupta, R. Kumar, and R. Rubinfeld. The complexity of approximating the entropy. SIAM Journal on Computing, 35(1):132-150, 2005.
6. Conference version appeared in the proceedings of Computational Complexity, 2002.
7. T. Batu, E. Fischer, L. Fortnow, R. Kumar, R. Rubinfeld, and P. White. Testing random variables for independence and identity. In Proceedings of FOCS, pages 442-451, 2001.
8. T. Batu, L. Fortnow, R. Rubinfeld, W. Smith, and P. White. Testing that distributions are close. In Proceedings of FOCS, pages 259-269, 2000.
9. J. Bunge. Bibligraphy on estimating the number of classes in a population. Available from www.stat.cornell.edu/~bunge/.
10. M. Charikar, S. Chaudhuri, R. Motwani, and V. R. Narasayya. Towards estimation error guarantees for distinct values. In PODS, pages 268-279. ACM, 2000.
11. T. Cover and J. Thomas. Elements of Information Theory. John Wiley & Sons, Inc., New York, 1991.
12. P. Indyk and D. Woodruff. Tight lower bounds for the distinct elements problem. In Proceedings of FOCS, pages 283-288, 2003.
13. Y. V. Prohorov. Asymptotic behavior of the binomial distribution (Russian). Uspekhii Matematicheskiikh Nauk, 8(3): 135-142, 1953. Moscow.
14. S. Raskhodnikova, D. Ron, R. Rubinfeld, and A. Smith. Sublinear algorithms for approximating string compressibility. In Proceedings of the 11th RANDOM, pages 609-623, 2007.
15. S. Raskhodnikova, D. Ron, A. Shpilka, and A. Smith. Strong lower bounds for approximating distribution support size and the distinct elements problem. Manuscript, 2007.
16. W. Szpankowski. Average Case Analysis of Algorithms on Sequences. John Wiley & Sons, Inc., New York, 2001.
17. M. Weba. Bounds for the total variation distance between the binomial and the poisson distribution in case of medium-sized success probabilities. J. Appl. Probab., 36(1):97-104, 1999.
18. J. Ziv and A. Lempel. A universal algorithm for sequential data compression. IEEE Transactions on Information Theory, 23:337-343, 1977.