{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,6]],"date-time":"2026-10-06T09:43:15Z","timestamp":1791279795884,"version":"4.1.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319483139","type":"print"},{"value":"9783319483146","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-48314-6_5","type":"book-chapter","created":{"date-parts":[[2016,11,3]],"date-time":"2016-11-03T11:01:04Z","timestamp":1478170864000},"page":"60-74","source":"Crossref","is-referenced-by-count":4,"title":["Public vs. Private Randomness in Simultaneous Multi-party Communication Complexity"],"prefix":"10.1007","author":[{"given":"Orr","family":"Fischer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rotem","family":"Oshman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Uri","family":"Zwick","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,11,4]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ahn, K.J., Guha, S., McGregor, A.: Graph sketches: sparsification, spanners, and subgraphs. In: Proceedings of the 31st Symposium on Principles of Database Systems, PODS 2012, pp. 5\u201314 (2012)","DOI":"10.1145\/2213556.2213560"},{"issue":"3","key":"5_CR2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF01955678","volume":"16","author":"A Ambainis","year":"1996","unstructured":"Ambainis, A.: Communication complexity in a 3-computer model. Algorithmica 16(3), 298\u2013301 (1996)","journal-title":"Algorithmica"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Babai, L., Kimmel, P.G.: Randomized simultaneous messages: solution of a problem of yao in communication complexity. In: Proceedings of the 12th Annual IEEE Conference on Computational Complexity, CCC 1997, p. 239. IEEE Computer Society (1997)","DOI":"10.1109\/CCC.1997.612319"},{"issue":"1","key":"5_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1137\/S0097539700375944","volume":"33","author":"L Babai","year":"2004","unstructured":"Babai, L., G\u00e1l, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SIAM J. Comput. 33(1), 137\u2013166 (2004)","journal-title":"SIAM J. Comput."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Becker, F., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., Todinca, I.: Adding a referee to an interconnection network: what can(not) be computed in one round. In: 25th IEEE International Symposium on Parallel and Distributed Processing, IPDPS 2011, pp. 508\u2013514 (2011)","DOI":"10.1109\/IPDPS.2011.55"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-09620-9_8","volume-title":"Structural Information and Communication Complexity","author":"F Becker","year":"2014","unstructured":"Becker, F., Montealegre, P., Rapaport, I., Todinca, I.: The simultaneous number-in-hand communication model for networks: private coins, public coins and determinism. In: Halld\u00f3rsson, M.M. (ed.) SIROCCO 2014. LNCS, vol. 8576, pp. 83\u201395. Springer, Heidelberg (2014). doi: 10.1007\/978-3-319-09620-9_8"},{"key":"5_CR7","unstructured":"Bourgain, J., Wigderson, A.: Personal communication (see [3])"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Proceedings of the Fourty-Second Annual Symposium on Foundations of Computer Science, FOCS 2001, pp. 270\u2013278 (2001)","DOI":"10.1109\/SFCS.2001.959901"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 94\u201399 (1983)","DOI":"10.1145\/800061.808737"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Chattopadhyay, A., Radhakrishnan, J., Rudra, A.: Topology matters in communication. In: 55th IEEE Annual Symposium on Foundations of Computer Science, FOCS 2014, Philadelphia, PA, USA, 18\u201321 October 2014, pp. 631\u2013640 (2014)","DOI":"10.1109\/FOCS.2014.73"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Jain, R., Klauck, H.: New results in the simultaneous message passing model via information theoretic techniques. In: Proceedings of the Twenty-Fourth Annual IEEE Conference on Computational Complexity, CCC 2009, pp. 369\u2013378 (2009)","DOI":"10.1109\/CCC.2009.28"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Kremer, I., Nisan, N., Ron, D.: On randomized one-round communication complexity. In: Proceedings of the Twenty-seventh Annual ACM Symposium on Theory of Computing, STOC 1995, pp. 596\u2013605 (1995)","DOI":"10.1145\/225058.225277"},{"key":"5_CR13","doi-asserted-by":"crossref","DOI":"10.1016\/S0065-2458(08)60342-3","volume-title":"Communication Complexity","author":"E Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press, Cambridge (1997)"},{"key":"5_CR14","volume-title":"The Theory of Error Correcting Codes","author":"FJ MacWilliams","year":"1981","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North-Halland, Amsterdam (1981)"},{"key":"5_CR15","unstructured":"McGregor, A.: Open problem 65. List of Open Problems in Sublinear Algorithms. http:\/\/sublinear.info\/index.php?title=Open_Problems:65"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Newman, I., Szegedy, M.: Public vs. private coin flips in one round communication games (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC 1996, pp. 561\u2013570 (1996)","DOI":"10.1145\/237814.238004"},{"key":"5_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1007\/978-3-662-47672-7_88","volume-title":"Automata, Languages, and Programming","author":"O Weinstein","year":"2015","unstructured":"Weinstein, O., Woodruff, D.P.: The simultaneous communication of disjointness with applications to data streams. In: Halld\u00f3rsson, M.M., Iwama, K., Kobayashi, N., Speckmann, B. (eds.) ICALP 2015. LNCS, vol. 9134, pp. 1082\u20131093. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-47672-7_88"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: Proceedings of the Eleventh Annual ACM Symposium on Theory of Computing, STOC 1979, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48314-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T22:43:47Z","timestamp":1498344227000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48314-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319483139","9783319483146"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48314-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}