{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T23:10:18Z","timestamp":1742598618078,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"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_87","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:59:11Z","timestamp":1330275551000},"page":"350-360","source":"Crossref","is-referenced-by-count":3,"title":["Optimal lower bounds on the multiparty communication complexity"],"prefix":"10.1007","author":[{"given":"Pavol","family":"\u010euri\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 D. P.","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"31_CR1","unstructured":"Aho, A., V., Ullman, J., D. and Yanakakis, M., Y.: On notion of information transfer in VLSI. In: Proc. 15th ACM STOC, 1983, 133\u2013139."},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Dolev, D. and Feder, T.: Multiparty communication complexity. In: Proc. 30th IEEE FOCS, 1989, 428\u2013433.","DOI":"10.1109\/SFCS.1989.63514"},{"key":"31_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90037-X","volume":"73","author":"P. \u010euri\u0161","year":"1987","unstructured":"\u010euri\u0161, P., Galil, Z. and Schitger, G.: Lower bounds on communication complexity. Information and Computation, 73 (1987), 1\u201322.","journal-title":"Information and Computation"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"F\u00fcrer, M.: The power of randomness in communication complexity. In: Proc. 19th ACM STOC, 1987, 178\u2013181.","DOI":"10.1145\/28395.28415"},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"Melhorn, K. and Schmidt, E., M.: Las Vegas is better in VLSI and distributed computing. Proc. 14th ACM STOC, 1982, 330\u2013337.","DOI":"10.1145\/800070.802208"},{"key":"31_CR6","unstructured":"Papadimitriou C., H. and Sipser, M.: Communication complexity. In: Proc. 14th ACM STOC, 1982, 196\u2013200."},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"Yao, A.: Some complexity questions related to distributive computing. In: Proc. 11th ACM STOC, 1979, 209\u2013213.","DOI":"10.1145\/800135.804414"}],"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_87.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:41:54Z","timestamp":1742596914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59042-0_87"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540590422","9783540491750"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-59042-0_87","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}