{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T03:12:22Z","timestamp":1764645142199},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540590422"},{"type":"electronic","value":"9783540491750"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59042-0_88","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:59:15Z","timestamp":1330275555000},"page":"361-372","source":"Crossref","is-referenced-by-count":18,"title":["Simultaneous messages vs. communication"],"prefix":"10.1007","author":[{"given":"L\u00e1szl\u00f3","family":"Babai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter G.","family":"Kimmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satyanarayana V.","family":"Lokam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Erd\u00f6s. Representation of Group Elements as Short Products. J. Turgeon, A. Rosa, G. Sabidussi, editor. Theory and Practice of Combinatorics, number 12, in Ann. Discr. Math., North-Holland, 1982, pp. 21\u201326.","DOI":"10.1016\/S0304-0208(08)73487-X"},{"key":"32_CR2","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"L. Babai, N. Nisan, M. Szegedy. Multiparty Protocols, Pseudorandom Generators for Logspace and Time-Space Trade-offs. Journal of Computer and System Sciences 45 (1992), pp. 204\u2013232.","journal-title":"Journal of Computer and System Sciences"},{"key":"32_CR3","unstructured":"R. Beigel, J. Tarui, On ACC. Proc. of the 32nd IEEE FOCS, 1991, pp. 783\u2013792."},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"A.K. Chandra, M.L. F\u00fcrst, R.J. Lipton, Multiparty protocols. Proc. of the 15th ACM STOC, 1983, pp. 94\u201399.","DOI":"10.1145\/800061.808737"},{"key":"32_CR5","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1006\/inco.1994.1051","volume":"112","author":"V. Grolmusz","year":"1994","unstructured":"V. Grolmusz, The BNS Lower Bound for Multi-Party Protocols is Nearly Optimal. Information and Computation, 112 (1994), pp. 51\u201354.","journal-title":"Information and Computation"},{"key":"32_CR6","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1007\/BF01272517","volume":"1","author":"J. H\u00e5stad","year":"1991","unstructured":"J. H\u00e5stad, M. Goldmann, On the Power of Small-Depth Threshold Circuits. Computational Complexity, 1 (1991), pp. 113\u2013129.","journal-title":"Computational Complexity"},{"key":"32_CR7","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0304-3975(93)90257-T","volume":"107","author":"Y. Mansour","year":"1993","unstructured":"Y. Mansour, N. Nisan, P. Tiwari, The Computational Complexity of Universal Hashing. Theoretical Computer Science, 107 (1993), pp. 121\u2013133.","journal-title":"Theoretical Computer Science"},{"key":"32_CR8","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N. Nisan","year":"1993","unstructured":"N. Nisan, A. Wigderson, Rounds in Communication Complexity Revisited. SIAM Journal on Computing, 22 (1993), pp. 211\u2013219.","journal-title":"SIAM Journal on Computing"},{"key":"32_CR9","unstructured":"P. Pudl\u00e1k, V. R\u00f6dl, J. Sgall. Boolean circuits, tensor ranks and communication complexity, manuscript, March 11, 1994."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"A. C-C. Yao, On ACC and Threshold Circuits. Proc. of the 31st IEEE FOCS, 1990, pp. 619\u2013627.","DOI":"10.1109\/FSCS.1990.89583"}],"container-title":["Lecture Notes in Computer Science","STACS 95"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59042-0_88.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T08:55:38Z","timestamp":1640940938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_88"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_88","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}