Hellinger strikes back: A note on the multi-party information complexity of AND

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5687 LNCS, Issue , 2009, Pages 562-573

  Jayram, T S ^a  

^a IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ANALYTIC APPROACH; COMMUNICATION COMPLEXITY; COMMUNICATION PROTOCOLS; DECISION PROBLEMS; DISJOINTNESS; HAND MODEL; HELLINGER DISTANCE; INFORMATION COMPLEXITY; INFORMATION GEOMETRY; LOWER BOUNDS;

COMBINATORIAL OPTIMIZATION; COMMUNICATION; CONTROL THEORY; SET THEORY; TECHNICAL PRESENTATIONS;

APPROXIMATION ALGORITHMS;

EID: 70350585347     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03685-9_42     Document Type: Conference Paper

References (20)

1. [Abl96] Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Computer Science 157(2), 139-159 (1996)
2. [AJP09] Andoni, A., Jayram, T.S., Patrascu, M.: Non-embeddability and sketching complexity via information geometry (2009)
3. [AMS99] Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. Journal of Computer and System Sciences 58(1), 137-147 (1999)
4. [BCKO93] Bar-Yehuda, R., Chor, B., Kushilevitz, E., Orlitsky, A.: Privacy, additional information, and communication. IEEE Transactions on Information Theory 39(6), 1930-1943 (1993)
5. [BGKS06] Bhuvanagiri, L., Ganguly, S., Kesh, D., Saha, C.: Simpler algorithm for estimating frequency moments of data streams. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pp. 708-713. ACMPress, New York (2006)
6. +02] Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D., Trevisan, L.: Counting distinct elements in a data stream. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol. 2483, pp. 1-10. Springer, Heidelberg (2002)
7. [BJKS04] Bar-Yossef, Z., Jayram, T.S., Kumar, R., Sivakumar, D.: An information statistics approach to data stream and communication complexity. J.Comput. Syst. Sci. 68(4), 702-732 (2004)
8. [CCFC04] Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theor. Comput. Sci. 312(1), 3-15 (2004)
9. [CKS03] Chakrabarti, A., Khot, S., Sun, X.: Near-optimal lower bounds on the multiparty communication complexity of set-disjointness. In: Proceedings of the 18th Annual IEEE Conference on Computational Complexity, pp. 107-117 (2003)
10. [CSWY01] Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.C.-C.: Informational complexity and the direct sumproblem for simultaneous message complexity. In: Proceedings of the 42nd IEEE Annual Symposium on Foundations of Computer Science (FOCS), pp. 270-278 (2001)
11. [DL97] Deza, M., Laurent, M.: Geometry of Cuts and Metrics. Springer, Heidelberg (1997)
12. [FM85] Flajolet, P., Martin, G.N.: Probabilistic counting algorithms for data base applications. J. Comput. Syst. Sci. 31(2), 182-209 (1985)
13. [Gro09] Gronemeier, A.: Asymptotically optimal lower bounds on the nih-multi-party information complexity of the and-function and disjointness. In: Albers, S., Marion, J.-Y. (eds.) STACS, Schloss Dagstuhl - Leibniz-Zentrumfuer Informatik, Germany Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany. Dagstuhl Seminar Proceedings, vol. 09001, pp. 505-516 (2009)
14. [Ind06] Indyk, P.: Stable distributions, pseudorandomgenerators, embeddings, and data stream computation. J. ACM 53(3), 307-323 (2006)
15. [IW05] Indyk, P., Woodruff, D.P.: Optimal approximations of the frequency moments of data streams. In: STOC, pp. 202-208 (2005)
16. [JW09] Jayram, T.S., Woodruff, D.: The data stream space complexity of cascaded norms (submitted, 2009)
17. p-sampling with applications (manuscript)
18. [Slo] Sloane, N.: The on-line encyclopedia of integer sequences!, http://www.research.att.com/~njas/sequences/A048651
19. [SS02] Saks, M., Sun, X.: Space lower bounds for distance approximation in the data stream model. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC), pp. 360-369 (2002)
20. [Yao79] Yao, A.C.-C.: Some complexity questions related to distributive computing. In: Proceedings of the 11th ACM Symposium on Theory of Computing (STOC), pp. 209-213 (1979)