Lower bounds for number-in-hand multiparty communication complexity, made easy

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2012, Pages 486-501

  Phillips, Jeff M ^a   Verbin, Elad ^b   Zhang, Qin ^b  

^a Department of Electrical and Computer Engineering   (United States)

^b AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

BLACKBOARD MODELS; DISTRIBUTED STREAMING; GRAPH CONNECTIVITY; LOWER BOUNDS; MESSAGE PASSING MODELS; MONITORING MODELS; MULTI-PARTY COMMUNICATION; MULTIPARTY COMMUNICATION COMPLEXITY;

MESSAGE PASSING;

EID: 84860134813     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973099.42     Document Type: Conference Paper

References (36)

1. P. K. Agarwal, S. Har-Peled, and K. Varadarajan. Geometric approximations via coresets. C. Trends Comb. and Comp. Geom. (E. Welzl), 2007.
2. P. K. Agarwal, S. Har-Peled, and K. R. Varadarajan. Approximating extent measure of points. J. ACM, 51:606-635, 2004.
3. C. Arackaparambil, J. Brody, and A. Chakrabarti. Functional monitoring without monotonicity. In ICALP, 2009.
4. B. Babcock and C. Olston. Distributed top-k monitoring. In SIGMOD, 2003.
5. Z. Bar-Yossef, T. S. Jayram, R. Kumar, and D. Sivakumar. An information statistics approach to data stream and communication complexity. J. Comput. Syst. Sci., 68:702-732, June 2004.
6. B. Barak, M. Braverman, X. Chen, and A. Rao. How to compress interactive communication. In STOC, pages 67-76, 2010.
7. P. Cao and Z. Wang. Efficient top-k query calculation in distributed networks. In PODC, 2004.
8. T. Chan. Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry: Theory and Applications, 35:20-35, 2006.
9. G. Cormode and M. Garofalakis. Sketching streams through the net: Distributed approximate query tracking. In VLDB, 2005.
10. G. Cormode, M. Garofalakis, S. Muthukrishnan, and R. Rastogi. Holistic aggregates in a networked world: Distributed tracking of approximate quantiles. In SIGMOD, 2005.
11. G. Cormode, S. Muthukrishnan, and K. Yi. Algorithms for distributed functional monitoring. In SODA, 2008.
12. G. Cormode, S. Muthukrishnan, K. Yi, and Q. Zhang. Optimal sampling from distributed streams. In PODS, 2010.
13. G. Cormode, S. Muthukrishnan, and W. Zhuang. What's different: Distributed, continuous monitoring of duplicate-resilient aggregates on data streams. In ICDE, 2006.
14. T. M. Cover and J. A. Thomas. Elements of Information Theory. Wiley-Interscience, 1991.
15. P. Duris and J. D. P. Rolim. Lower bounds on the multiparty communication complexity. J. Comput. Syst. Sci., 56(1):90-95, 1998. (Pubitemid 128430805)
16. A. Gal and P. Gopalan. Lower bounds on streaming algorithms for approximating the length of the longest increasing subsequence. In FOCS, 2007.
17. O. Goldreich. Secure multi-party computation. Working Draft, 2002. available at http://www.wisdom.weizmann.ac.il/~oded/pp.html.
18. S. Guha and Z. Huang. Revisiting the direct sum theorem and space lower bounds in random order streams. In ICALP, 2009.
19. Z. Huang, K. Yi, Y. Liu, and G. Chen. Optimal sampling algorithms for frequency. estimation in distributed data. In INFOCOM, 2011.
20. B. Kalyanasundaram and G. Schintger. The probabilistic communication complexity of set intersection. SIAM Journal on Discrete Mathematics, 5:545-557, 1992.
21. M. Karchmer, R. Raz, and A. Wigderson. Super-logarithmic depth lower bounds via the direct sum in communication complexity. Computational Complexity, 5(3/4):191-204, 1995. (Pubitemid 126090314)
22. R. Keralapura, G. Cormode, and J. Ramamirtham. Communication-efficient distributed monitoring of thresholded counts. In SIGMOD, 2006.
23. E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge, 1997.
24. A. Manjhi, V. Shkapenyuk, K. Dhamdhere, and C. Olston. Finding (recently) frequent items in distributed data streams. In ICDE, 2005.
25. A. Metwally, D. Agrawal, and A. E. Abbadi. An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Transactions on Database Systems, 2006.
26. S. Michel, P. Triantafillou, and G. Weikum. Klee: a framework for distributed top-k query algorithms. In VLDB, 2005.
27. J. Misra and D. Gries. Finding repeated elements. Sc. Comp. Prog., 2:143-152, 1982.
28. M. Patrascu. Towards polynomial lower bounds for dynamic problems. In STOC, pages 603-610, 2010.
29. B. Patt-Shamir and A. Shafrir. Approximate distributed top-k queries. Distributed Computing, 21(1):1-22, 2008.
30. A. A. Razbarov. On the distributional complexity of disjointness. In Theor. Comput. Sci., 106(2):385-390, 1990.
31. I. Sharfman, A. Schuster, and D. Keren. A geometric approach to monitoring threshold functions over distribtuted data streams. In SIGMOD, 2006.
32. I. Sharfman, A. Schuster, and D. Keren. Shape sensitive geometric monitoring. In PODS, 2008.
33. A. C.-C. Yao. Probabilistic computations: Toward a unified measure of complexity (extended abstract). In FOGS, 1977.
34. K. Yi and Q. Zhang. Optimal tracking of distributed heavy hitters and quantiles. In PODS, 2009.
35. H. Yu, P. K. Agarwal, R. Poreddy, and K. R. Varadarajan. Practical methods for shape fitting and kinetic data structures using coresets. In SoCG, 2004.
36. Q. Zhao, M. Ogihara, H. Wang, and J. Xu. Finding global icebergs over distributed data sets. In PODS, 2006.