{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T23:10:08Z","timestamp":1683241808194},"reference-count":17,"publisher":"EDP Sciences","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Theor. Inf. Appl."],"published-print":{"date-parts":[[2005,10]]},"DOI":"10.1051\/ita:2005037","type":"journal-article","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:16:10Z","timestamp":1128431770000},"page":"687-706","source":"Crossref","is-referenced-by-count":1,"title":["One-way communication complexity of symmetric Boolean functions"],"prefix":"10.1051","volume":"39","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":"250","published-online":{"date-parts":[[2005,10,15]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(95)00157-3","volume":"157","author":"Ablayev","year":"1996","journal-title":"Theoret. Comp. Sci."},{"key":"R2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1007\/978-3-540-30539-2_11","volume":"3329","author":"Bl\u00e4ser","year":"2004","journal-title":"Lect. Notes. Comput. Sci."},{"key":"R3","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1137\/S0097539794265578","volume":"27","author":"Condon","year":"1998","journal-title":"SIAM J. Comput."},{"key":"R4","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BFb0023453","volume":"1200","author":"\u010euri\u0161","year":"1997","journal-title":"Lect. Notes. Comput. Sci."},{"key":"R5","unstructured":"J.E. Hopcroft and J.D. Ullman,Formal Languages and Their Relation to Automata. Addison-Wesley, Reading, Massachusetts (1969)."},{"key":"R6","doi-asserted-by":"crossref","unstructured":"J. Hromkovi\u010d,Communication Complexity and Parallel Computing. Springer-Verlag (1997).","DOI":"10.1007\/978-3-662-03442-2"},{"key":"R7","unstructured":"I.S. Iohvidov,Hankel and Toeplitz Matrices and Forms. Birkh\u00e4user, Boston (1982)."},{"key":"R8","doi-asserted-by":"crossref","unstructured":"H. Klauck,On quantum and probabilistic communication: Las Vegas and one-way protocols, inProc. of the 32nd Ann. ACM Symp. on Theory of Computing (STOC)(2000) 644\u2013651.","DOI":"10.1145\/335305.335396"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"I. Kremer, N. Nisan and D. Ron, On randomized one-round communication complexity,Computational Complexity8(1999) 21\u201349.","DOI":"10.1007\/s000370050018"},{"key":"R10","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz and N. Nisan,Communication Complexity. Camb. Univ. Press (1997).","DOI":"10.1017\/CBO9780511574948"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn and E.M. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, inProc. of the 14th Ann. ACM Symp. on Theory of Computing (STOC)(1982) 330\u2013337.","DOI":"10.1145\/800070.802208"},{"key":"R12","doi-asserted-by":"crossref","unstructured":"I. Newman and M. Szegedy,Public vs. private coin flips in one round communication games, inProc. of the 28th Ann. ACM Symp. on Theory of Computing (STOC)(1996) 561\u2013570.","DOI":"10.1145\/237814.238004"},{"key":"R13","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"R14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/S0019-9958(84)80031-5","volume":"62","author":"Wegener","year":"1984","journal-title":"Inform. Control"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"I. Wegener,The complexity of Boolean functions. Wiley-Teubner (1987).","DOI":"10.1007\/3-540-18170-9_185"},{"key":"R16","unstructured":"I. Wegener, personal communication (April 2003)."},{"key":"R17","doi-asserted-by":"crossref","unstructured":"A.C. Yao,Some complexity questions related to distributive computing, inProc. of the 11th Ann. ACM Symp. on Theory of Computing (STOC)(1979) 209\u2013213.","DOI":"10.1145\/800135.804414"}],"container-title":["RAIRO - Theoretical Informatics and Applications"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2005037\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,4]],"date-time":"2023-05-04T22:42:08Z","timestamp":1683240128000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita:2005037"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":17,"journal-issue":{"issue":"4"},"alternative-id":["ita0502"],"URL":"https:\/\/doi.org\/10.1051\/ita:2005037","relation":{},"ISSN":["0988-3754","1290-385X"],"issn-type":[{"value":"0988-3754","type":"print"},{"value":"1290-385X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}