{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:52:01Z","timestamp":1725565921653},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_63","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"745-756","source":"Crossref","is-referenced-by-count":6,"title":["Communication Versus Computation"],"prefix":"10.1007","author":[{"given":"Prahladh","family":"Harsha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuval","family":"Ishai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joe","family":"Kilian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kobbi","family":"Nissim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Venkatesh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"63_CR1","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1137\/S0097539700375944","volume":"33","author":"L. Babai","year":"2003","unstructured":"Babai, L., G\u00e1l, A., Kimmel, P.G., Lokam, S.V.: Communication complexity of simultaneous messages. SIAM Journal of Computing\u00a033(1), 137\u2013166 (2003) (Preliminary Version in 12th STACS (1995))","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"63_CR2","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1137\/S0097539791196883","volume":"23","author":"P. Beame","year":"1994","unstructured":"Beame, P., Tompa, M., Yan, P.: Communication-space tradeoffs for unrestricted protocols. SIAM Journal of Computing\u00a023(3), 652\u2013661 (1994) (Preliminary Version in 31st FOCS (1990))","journal-title":"SIAM Journal of Computing"},{"key":"63_CR3","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF01200118","volume":"3","author":"R. Canetti","year":"1993","unstructured":"Canetti, R., Goldreich, O.: Bounds on tradeoffs between randomness and communication complexity. Computational Complexity\u00a03, 141\u2013167 (1993) (Preliminary Version in 31st FOCS (1990))","journal-title":"Computational Complexity"},{"key":"63_CR4","doi-asserted-by":"crossref","unstructured":"Chandra, A.K., Furst, M.L., Lipton, R.J.: Multi-party protocols. In: Proc. 15th ACM Symp. on Theory of Computing, Boston, Massachusetts, April 25-27, pp. 94\u201399 (1983)","DOI":"10.1145\/800061.808737"},{"issue":"1","key":"63_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(87)90037-X","volume":"73","author":"P. Duris","year":"1987","unstructured":"Duris, P., Galil, Z., Schnitger, G.: Lower bounds on communication complexity. Information and Computation\u00a073(1), 1\u201322 (1987)","journal-title":"Information and Computation"},{"key":"63_CR6","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Proc. 21st ACM Symp. on Theory of Computing, Seattle, Washington, May 15\u201317, pp. 25\u201332 (1989)","DOI":"10.1145\/73007.73010"},{"key":"63_CR7","unstructured":"Harsha, P., Ishai, Y., Kilian, J., Nissim, K., Venkatesh, S.: Communication vs. computation. Technical Report (to be posted in ECCC), Available at http:\/\/theory.csail.mit.edu\/~prahladh\/papers\/"},{"issue":"3","key":"63_CR8","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1016\/0022-0000(93)90038-X","volume":"47","author":"J. H\u00e5stad","year":"1993","unstructured":"H\u00e5stad, J., Schrift, A.W., Shamir, A.: The discrete logarithm modulo a composite hides O(n) bits. Journal of Computer and System Sciences\u00a047(3), 376\u2013404 (1993) (Preliminary Version in 22nd STOC (1990))","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"63_CR9","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N. Nisan","year":"1993","unstructured":"Nisan, N., Wigderson, A.: Rounds in communication complexity revisited. SIAM Journal of Computing 22\u00a022(1), 211\u2013219 (1993) (Preliminary Version in 23rd STOC (1991))","journal-title":"SIAM Journal of Computing 22"},{"issue":"2","key":"63_CR10","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H., Sipser, M.: Communication complexity. Journal of Computer and System Sciences\u00a028(2), 260\u2013269 (1984) (Preliminary Version in 14th STOC (1982))","journal-title":"Journal of Computer and System Sciences"},{"key":"63_CR11","doi-asserted-by":"crossref","unstructured":"Schrift, A.W., Shamir, A.: The discrete log is very discreet. In: Proc. 22nd ACM Symp. on Theory of Computing, Baltimore, Maryland, May 14-16, pp. 405\u2013415 (1990)","DOI":"10.1145\/100216.100271"},{"key":"63_CR12","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Some complexity questions related to distributive computing (preliminary report). In: Proc. 11th ACM Symp. on Theory of Computing, Atlanta, Georgia, April 30-May 2, pp. 209\u2013213 (1979)","DOI":"10.1145\/800135.804414"},{"key":"63_CR13","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: How to generate and exchange secrets (extended abstract). In: Proc. 27th IEEE Symp. on Foundations of Comp. Science, Toronto, Ontario, Canada, October 27-29, pp. 162\u2013167 (1986)","DOI":"10.1109\/SFCS.1986.25"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_63.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:24:03Z","timestamp":1605759843000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}