{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:53:19Z","timestamp":1725558799536},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540405436"},{"type":"electronic","value":"9783540450771"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45077-1_16","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T16:53:34Z","timestamp":1277484814000},"page":"158-170","source":"Crossref","is-referenced-by-count":1,"title":["One-Way Communication Complexity of Symmetric Boolean Functions"],"prefix":"10.1007","author":[{"given":"Jan","family":"Arpe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Jakoby","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maciej","family":"Li\u015bkiewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0304-3975(95)00157-3","volume":"157","author":"F. Ablayev","year":"1996","unstructured":"Ablayev, F.: Lower bounds for one-way probabilistic communication complexity and their application to space complexity. Theoretical Comp. Sc.\u00a0157, 139\u2013159 (1996)","journal-title":"Theoretical Comp. Sc."},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/S0097539794265578","volume":"27","author":"A. Condon","year":"1998","unstructured":"Condon, A., Hellerstein, L., Pottle, S., Wigderson, A.: On the power of finite automata with both nondeterministic and probabilistic states. SIAM J. Comput.\u00a027, 739\u2013762 (1998)","journal-title":"SIAM J. Comput."},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BFb0023453","volume-title":"Proc. 14th STACS","author":"P. \u010euri\u0161","year":"1997","unstructured":"\u010euri\u0161, P., Hromkovi\u010d, J., Rolim, J.D.P., Schnitger, G.: On the power of Las Vegas for one-way communication complexity, finite automata, and polynomialtime computations. In: Proc. 14th STACS, pp. 117\u2013128. Springer, Heidelberg (1997)"},{"key":"16_CR4","volume-title":"Formal Languages and Their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"Hopcroft, J.E., Ullman, J.D.: Formal Languages and Their Relation to Automata. Addison-Wesley, Reading (1969)"},{"key":"16_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03442-2","volume-title":"Communication Complexity and Parallel Computing","author":"J. Hromkovi\u010d","year":"1997","unstructured":"Hromkovi\u010d, J.: Communication Complexity and Parallel Computing. Springer, Heidelberg (1997)"},{"key":"16_CR6","volume-title":"Hankel and Toeplitz Matrices and Forms","author":"I.S. Iohvidov","year":"1982","unstructured":"Iohvidov, I.S.: Hankel and Toeplitz Matrices and Forms. Birkh\u00e4user, Boston (1982)"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Klauck, H.: On quantum and probabilistic communication: Las Vegas and one-way protocols. In: Proc. 32nd STOC, pp. 644\u2013651 (2000)","DOI":"10.1145\/335305.335396"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s000370050018","volume":"8","author":"I. Kremer","year":"1999","unstructured":"Kremer, I., Nisan, N., Ron, D.: On randomized one-round communication complexity. Computational Complexity\u00a08, 21\u201349 (1999)","journal-title":"Computational Complexity"},{"key":"16_CR9","volume-title":"Communication Complexity","author":"E. Kushilevitz","year":"1997","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Camb. Univ. Press, New York (1997)"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Mehlhorn, K., Schmidt, E.M.: Las Vegas is better than determinism in VLSI and distributed computing. In: Proc. 14th STOC, pp. 330\u2013337 (1982)","DOI":"10.1145\/800070.802208"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Newman, I., Szegedy, M.: Public vs. private coin flips in one round communication games. In: Newman, I., Szegedy, M. (eds.) Proc. 28th STOC, pp. 561\u2013570 (1996)","DOI":"10.1145\/237814.238004"},{"key":"16_CR12","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"C. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C., Sipser, M.: Communication complexity. J. Comput. System Sci.\u00a028, 260\u2013269 (1984)","journal-title":"J. Comput. System Sci."},{"key":"16_CR13","volume-title":"The complexity of Boolean functions","author":"I. Wegener","year":"1987","unstructured":"Wegener, I.: The complexity of Boolean functions. Wiley-Teubner, Chichester (1987)"},{"key":"16_CR14","unstructured":"Wegener, I.: personal communication (April 2003)"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Some complexity questions related to distributive computing. In: Proc. 11th STOC, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45077-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T00:52:06Z","timestamp":1591404726000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45077-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540405436","9783540450771"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45077-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}