{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:34:54Z","timestamp":1787340894255,"version":"build-2736575974"},"reference-count":45,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","funder":[{"DOI":"10.13039\/100006733","name":"Indiana University","doi-asserted-by":"publisher","award":["N\/A"],"award-info":[{"award-number":["N\/A"]}],"id":[{"id":"10.13039\/100006733","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007523","name":"Advanced Cyberinfrastructure","doi-asserted-by":"publisher","award":["1443046"],"award-info":[{"award-number":["1443046"]}],"id":[{"id":"10.13039\/100007523","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1525024"],"award-info":[{"award-number":["1525024"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["1350888"],"award-info":[{"award-number":["1350888"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["1251019"],"award-info":[{"award-number":["1251019"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61061130540"],"award-info":[{"award-number":["61061130540"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2016,1]]},"abstract":"<jats:p>In this paper we prove lower bounds on randomized multiparty communication complexity, mainly in the message-passing model, where messages are sent player-to-player. Some of our results apply to the blackboard model, where each message is written on a blackboard for all players to see. We introduce a new technique for proving such bounds, called symmetrization, which is natural, intuitive, and often easy to use. For example, for the problem where each of $k$ players gets a bit-vector of length $n$, and the goal is to compute the coordinatewise XOR of these vectors, we prove a tight lower bound of $\\Omega(nk)$ in the blackboard model. For the same problem with AND instead of XOR, we prove a lower bound of roughly $\\Omega(nk)$ in the message-passing model (assuming $k \\le n\/3200$) and $\\Omega(n \\log k)$ in the blackboard model. We also prove lower bounds for bitwise majority, for a graph-connectivity problem, and for other problems; the technique seems applicable to a wide range of other problems as well. All of our lower bounds allow randomized communication protocols with two-sided error. We also use the symmetrization technique to prove several direct-sum-like results for multiparty communication.<\/jats:p>","DOI":"10.1137\/15m1007525","type":"journal-article","created":{"date-parts":[[2016,2,25]],"date-time":"2016-02-25T09:40:54Z","timestamp":1456393254000},"page":"174-196","source":"Crossref","is-referenced-by-count":9,"title":["Lower Bounds for Number-in-Hand Multiparty Communication Complexity, Made Easy"],"prefix":"10.1137","volume":"45","author":[{"given":"Jeff M.","family":"Phillips","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Elad","family":"Verbin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2016,2,25]]},"reference":[{"key":"atypb1","first-page":"1","author":"Agarwal P. K.","year":"2005","journal-title":"Cambridge"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008736"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"atypb4","first-page":"95","author":"Arackaparambil C.","year":"2009","journal-title":"Berlin"},{"key":"atypb5","first-page":"28","author":"Babcock B.","year":"2003","journal-title":"Proceedings of the ACM SIGMOD International Conference on Management of Data"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2003.11.006"},{"key":"atypb7","first-page":"67","author":"Barak B.","year":"2010","journal-title":"New York"},{"key":"atypb8","first-page":"668","author":"Braverman M.","year":"2013","journal-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA"},{"key":"atypb9","first-page":"206","author":"Cao P.","year":"2004","journal-title":"New York"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959901"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2005.10.002"},{"key":"atypb12","first-page":"631","author":"Chattopadhyay A.","year":"2014","journal-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA"},{"key":"atypb13","first-page":"13","author":"Cormode G.","year":"2005","journal-title":"VLDB Endowment"},{"key":"atypb14","first-page":"25","author":"Cormode G.","year":"2005","journal-title":"New York"},{"key":"atypb15","first-page":"1076","author":"Cormode G.","year":"2008","journal-title":"New York"},{"key":"atypb16","first-page":"77","author":"Cormode G.","year":"2010","journal-title":"New York"},{"key":"atypb17","doi-asserted-by":"crossref","unstructured":"G. Cormode, S. Muthukrishnan, and W. Zhuang,\n                      What's different: Distributed, continuous monitoring of duplicate-resilient aggregates on data streams\n                      , in Proceedings of the 22nd IEEE International Conference on Data Engineering, IEEE, Washington, DC, 2006, article 57.","DOI":"10.1109\/ICDE.2006.173"},{"key":"atypb18","unstructured":"T. M. Cover and J. A. Thomas,\n                      Elements of Information Theory\n                      , Wiley-Interscience, New York, 1991."},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1547"},{"key":"atypb20","first-page":"294","author":"G\u00e1l A.","year":"2007","journal-title":"Proceedings of the IEEE Symposium on Foundations of Computer Science"},{"key":"atypb21","unstructured":"O. Goldreich,\n                      Secure multi-party computation\n                      , Working draft, 2002, available at \\burlhttp:\/\/www.wisdom.weizmann.ac.il\/ oded\/pp.html."},{"key":"atypb22","first-page":"513","author":"Guha S.","year":"2009","journal-title":"Berlin"},{"key":"atypb23","first-page":"760","author":"Guha S.","year":"2008","journal-title":"Berlin"},{"key":"atypb24","first-page":"1997","author":"Huang Z.","year":"2011","journal-title":"Washington, DC"},{"key":"atypb25","unstructured":"Z. Huang, B. Radunovic, M. Vojnovic, and Q. Zhang,\n                      Communication Complexity of Approximate Maximum Matching in Distributed Graph Data\n                      , Tech. report MSR-TR-2013-35, Microsoft Research, Redmond, WA, 2013."},{"key":"atypb26","doi-asserted-by":"crossref","unstructured":"Z. Huang, K. Yi, and Q. Zhang,\n                      Randomized algorithms for tracking distributed count, frequencies, and ranks\n                      , in Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, 2012, ACM New York, pp. 295-306.","DOI":"10.1145\/2213556.2213596"},{"key":"atypb27","doi-asserted-by":"publisher","DOI":"10.1137\/0405044"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1007\/BF01206317"},{"key":"atypb29","first-page":"289","author":"Keralapura R.","year":"2006","journal-title":"ACM New York"},{"key":"atypb30","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan,\n                      Communication Complexity\n                      , Cambridge University Press, Cambridge, UK, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"atypb31","first-page":"499","author":"Li Y.","year":"2014","journal-title":"Heidelberg"},{"key":"atypb32","first-page":"767","author":"Manjhi A.","year":"2005","journal-title":"IEEE Computer Society Washington, DC"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1145\/1166074.1166084"},{"key":"atypb34","unstructured":"S. Michel, P. Triantafillou, and G. Weikum,\n                      Klee: A framework for distributed top-k query algorithms\n                      , in Proceedings of the 31st International Conference on Very Large Databases, 2005, pp. 637-648."},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1016\/0167-6423(82)90012-0"},{"key":"atypb36","first-page":"603","author":"Patrascu M.","year":"2010","journal-title":"New York"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-008-0055-3"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90260-M"},{"key":"atypb39","first-page":"941","author":"Woodruff D. P.","year":"2012","journal-title":"New York"},{"key":"atypb40","first-page":"16","author":"Woodruff D. P.","year":"2013","journal-title":"Heidelberg"},{"key":"atypb41","first-page":"718","author":"Woodruff D. P.","year":"2014","journal-title":"Philadelphia"},{"key":"atypb42","doi-asserted-by":"crossref","unstructured":"A. C.C. Yao,\n                      Probabilistic computations: Toward a unified measure of complexity (extended abstract)\n                      , in Proceedings of the 18th Annual Symposium on Foundations of Computer Science, 1977, IEEE Computer Society, Long Beach, CA, pp. 222-227.","DOI":"10.1109\/SFCS.1977.24"},{"key":"atypb43","first-page":"167","author":"Yi K.","year":"2009","journal-title":"Proceedings of the ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems"},{"key":"atypb44","first-page":"263","author":"Yu H.","year":"2004","journal-title":"Proceedings of the ACM Symposium on Computational Geometry"},{"key":"atypb45","first-page":"298","author":"Zhao Q.","year":"2006","journal-title":"New York"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/15M1007525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:54:55Z","timestamp":1787338495000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/15M1007525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["10.1137\/15M1007525"],"URL":"https:\/\/doi.org\/10.1137\/15m1007525","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1]]}}}