{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:20:39Z","timestamp":1771485639203,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540569398","type":"print"},{"value":"9783540478263","type":"electronic"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_76","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:55:58Z","timestamp":1330257358000},"page":"241-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Lower bounds for one-way probabilistic communication complexity"],"prefix":"10.1007","author":[{"given":"Farid","family":"Ablayev","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"F.Ablayev: Lower Bounds for One-way Probabilistic Communication Complexity. University of Rochester, Computer Science Department, July 1992 TR422.","DOI":"10.1007\/3-540-56939-1_76"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1007\/3-540-51486-4_104","volume":"379","author":"F. Ablayev","year":"1989","unstructured":"F.Ablayev: On Comparing Probabilistic and Deterministic Automata Complexity of Languages. In: Proceedings of MFCS'89, Lecture Notes in Computer Science, 379, (1989), 599\u2013605.","journal-title":"Lecture Notes in Computer Science"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"N.Alon, P.frankl, V.Rodl: Geometrical realization of set systems and probabilistic communication complexity. In: Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, (1985), 277\u2013280.","DOI":"10.1109\/SFCS.1985.30"},{"issue":"2","key":"20_CR4","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"B.Chor, O.Goldreich: Unibased bits from sourcesof weak randomness and probabilistic communication complexity. SIAM J. Comput. 17, 2, (1988), 230\u2013261.","journal-title":"SIAM J. Comput."},{"key":"20_CR5","first-page":"575","volume":"8","author":"P. D. Dieu","year":"1972","unstructured":"Phan Dinh Dieu: On a Necessary Condition for Stochastic Languages. Elektronische Informationsverarbeitung und Kybernetik, 8 (1972), 575\u2013588.","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"P.Duris, Z.Galil, G.Schnitger: Lower bounds on Communication Complexity. In: Proc. of the 16th Annual ACM Symposium on the Theory of Computing, (1984), 81\u201389.","DOI":"10.1145\/800057.808668"},{"key":"20_CR7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume":"74","author":"R. Freivalds","year":"1979","unstructured":"R.Freivalds: Fast Probabilistic Algorithms. In: Proc. of the Conference Mathematical Foundation of Computer Science 1979, Lect. Notes in Comput. Science, 74 (1979), 57\u201369.","journal-title":"Lect. Notes in Comput. Science"},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"B.Halstenberg, R.Reischuk: On Different Modes of Communication. In: Proc. of the 20th Annual ACM Symposium on the Theory of Computing, (1988), 162\u2013172.","DOI":"10.1145\/62212.62226"},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0213052","volume":"13","author":"J. Ja'Ja'","year":"1984","unstructured":"J.Ja'Ja', V.K.Prasana Kumar, J.Simon: Information transfer under different sets of protocols. SIAM J. Comput. 13 (1984), 840\u2013849.","journal-title":"SIAM J. Comput."},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"324","DOI":"10.1016\/0022-0000(92)90025-E","volume":"44","author":"T. W. Lam","year":"1992","unstructured":"T. Wah Lam and W. Ruzzo: Results on Communication Complexity Classes. Journal of Computer and System Sciences, 44 (1992), 324\u2013342.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR11","unstructured":"L. Lovasz: Communication Complexity: A Survey. In: Korte, Lovasz, Promel, Schrijver (eds.): \u201cPaths, Flows and VLSI Layout\u201d, Springer 1990, pp.235\u2013266."},{"key":"20_CR12","unstructured":"A.Orlitsky, A. El Gamal: Communication complexity. In Yaser S. Abu-Mostafa(ed.): Complexity in information theory. Springer 1988, pp. 17\u201361."},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"C.H.Papadimitrio, M.Sipser. Communication Complexity. In: Proc. 14th ACM Annual ACM Symposium on the Theory of Computing, (1983), 196\u2013200.","DOI":"10.1145\/800070.802192"},{"key":"20_CR14","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"H. Paturi","year":"1986","unstructured":"H. Paturi and J.Simon: Probabilistic Communication Complexity. Journal of Computer and System Sciences, 33 (1986), 106\u2013123.","journal-title":"Journal of Computer and System Sciences"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/S0019-9958(63)90290-0","volume":"6","author":"M. O. Rabin","year":"1963","unstructured":"M.O Rabin: Probabilistic automata. Information and Control, 6 (1963), 230\u2013244.","journal-title":"Information and Control"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"A.C.Yao: Some Complexity Questions Related to Distributive Computing. In: Proc. of the 11th Annual ACM Symposium on the Theory of Computing, (1979), 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"A.C.Yao: Lower Bounds by Probabilistic Arguments. In: Proc. of the 24th Annual IEEE Symposium on Foundations of Computer Science, (1983), 420\u2013428.","DOI":"10.1109\/SFCS.1983.30"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:57:59Z","timestamp":1742594279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"28 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}