{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T02:10:29Z","timestamp":1736129429982,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029945","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"5-18","source":"Crossref","is-referenced-by-count":1,"title":["Communication complexity"],"prefix":"10.1007","author":[{"given":"L\u00e1szl\u00f3","family":"Babai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"2_CR1","unstructured":"A. Ambainis: Upper Bounds on Multiparty Communication Complexity of Shifts. 13th Symp. on Theoretical Aspects of Comp. Sci., Springer Lecture Notes In Comp. Sci. 1046 (1996) 631\u2013642."},{"key":"2_CR2","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF01955678","volume":"16","author":"A. Ambainis","year":"1996","unstructured":"A. Ambainis: Communication Complexity in a 3-Computer Model. Algorithmica 16 (1996), 298\u2013301.","journal-title":"Algorithmica"},{"key":"2_CR3","unstructured":"A. Ambainis, S. V. Lokam: Improved bounds for 3-player generalized addressing. Private communication, 1996."},{"key":"2_CR4","unstructured":"N. Alon, J. H. Spencer: The Probabilistic Method. John Wiley & Sons, Inc, 1992."},{"key":"2_CR5","unstructured":"L. Babai: The Fourier Transform and Equations Over Finite Abelian Groups, Lecture Notes, version 1.2., Univ. of Chicago, December 1989"},{"key":"2_CR6","unstructured":"L. Babai, A. G\u00e1l, P. Kimmel, S. V. Lokam: Simultaneous Messages vs. Communication. Updated version of [BKL], Univ. Chicago Tech. Rep. 96-23, November 1996."},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"L. Babai, T. Hayes, P. Kimmel: The cost of the missing bit: communication complexity with help. Manuscript, June 1997.","DOI":"10.1145\/276698.276883"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Kimmel: Randomized simultaneous messages: solution of a problem of Yao in communication complexity. Univ. Chicago Tech Report, March 1996. 12th IEEE Symp. on Structure in Complexity Theory (1997), to appear.","DOI":"10.1109\/CCC.1997.612319"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-59042-0_88","volume":"900","author":"L. Babai","year":"1995","unstructured":"L. Babai, P. Kimmel, S. V. Lokam: Simultaneous Messages vs. Communication. 12th Symposium on Theoretical Aspects of Comp. Sci., Springer Lecture Notes in Comp. Sci. 900 (1995) 361\u2013372.","journal-title":"Springer Lecture Notes in Comp. Sci."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/0022-0000(92)90047-M","volume":"45","author":"L. Babai","year":"1992","unstructured":"L. Babai, N. Nisan, M. Szegedy: Multiparty Protocols, Pseudorandom Generators for Logspace and Time-Space Trade-offs. Journal of Comp. and Sys. Sci. 45 (1992) 204\u2013232. (Prelim. version 21st ACM STOC (1989) 1\u201311.)","journal-title":"Journal of Comp. and Sys. Sci."},{"key":"2_CR11","unstructured":"R. Beigel, J. Tarui: On ACC. 32nd IEEE FOCS (1991) 783\u2013792."},{"key":"2_CR12","unstructured":"J. Bourgain, A. Wigderson. Private communication by Avi Wigderson, Feb. 1996. Cf. [BK] for details."},{"key":"2_CR13","unstructured":"A. K. Chandra, M. L. Furst, R. J. Lipton: Multiparty protocols. 15th ACM STOC (1983) 94\u201399."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1137\/0217015","volume":"17","author":"B. Chor","year":"1988","unstructured":"B. Chor, O. Goldreich: Unbiased bits from sources of weak randomness and probabilistic communication complexity. SIAM J. Comp. 17 (1988) 230\u2013261. (Prelim. version: 26th FOGS (1985) 429\u2013442.)","journal-title":"SIAM J. Comp."},{"key":"2_CR15","unstructured":"B. Chor, O. Goldreich, E. Kushilevitz, M. Sudan: Private Information Retrieval. 36th IEEE FOCS (1995) 523\u2013531."},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0898-1221(75)90037-1","volume":"1","author":"P. Erd\u0151s","year":"1975","unstructured":"P. Erd\u0151s, R. L. Graham, E. Szemer\u00e9di: On sparse graphs with dense long paths. Computers and Math. with Appl. 1 (1975) 365\u2013369.","journal-title":"Computers and Math. with Appl."},{"key":"2_CR17","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/3-540-54233-7_176","volume":"510","author":"H. D. Gr\u00f6ger","year":"1991","unstructured":"H. D. Gr\u00f6ger, G. Tur\u00e1n: On linear decision trees computing boolean functions. 18th ICALP, Springer Lecture Notes in Comp. Sci. 510 (1991) 707\u2013719.","journal-title":"Springer Lecture Notes in Comp. Sci."},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/inco.1994.1051","volume":"112","author":"V. Grolmusz","year":"1994","unstructured":"V. Grolmusz: The BNS Lower Bound for Multi-Party Protocols is Nearly Optimal. Information and Computation 112 (1994) 51\u201354.","journal-title":"Information and Computation"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"V. Grolmusz. Harmonic Analysis, Real Approximation, and the Communication Complexity of Boolean Functions. Proc. COCOON 1996.","DOI":"10.1007\/3-540-61332-3_147"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"V. Grolmusz. Separating the Communication Complexities of MOD m and MOD p Circuits. 33rd IEEE FOCS (1992) 278\u2013287.","DOI":"10.1109\/SFCS.1992.267764"},{"key":"2_CR21","unstructured":"V. Grolmusz: A Weight-Size Trade-Off for Circuits with MOD m Gates. 26th ACM STOC (1994) 68\u201374."},{"key":"2_CR22","unstructured":"A. Hajnal, W. Maass, P. Pudl\u00e1k, M. Szegedy, G. Tur\u00e1n: Threshold circuits of bounded depth. 28th IEEE FOCS (1987) 99\u2013110."},{"key":"2_CR23","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF01272517","volume":"1","author":"J. H\u00e5stad","year":"1991","unstructured":"J. H\u00e5stad, M. Goldmann: On the Power of Small-Depth Threshold Circuits. Computational Complexity 1 (1991) 113\u2013129.","journal-title":"Computational Complexity"},{"key":"2_CR24","unstructured":"M. Karchmer, R. Raz, A. Wigderson: On proving super-logarithmic depth lower bounds via the direct sum in communication complexity. 6th IEEE Symp. on Structure in Complexity Theory (1991) 299\u2013304."},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1137\/0403021","volume":"3","author":"M. Karchmer","year":"1990","unstructured":"M. Karchmer and A. Wigderson. Monotone circuits for connectivity require super-logarithmic depth. SIAM J. on Disc. Math. 3 (1990) 255\u2013265. (Prelim. version: 20th ACM STOC (1988) 539\u2013550.)","journal-title":"SIAM J. on Disc. Math."},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"E. Kushilevitz, N. Nisan: Communication Complexity. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511574948"},{"key":"2_CR27","unstructured":"I. Kremer, N. Nisan, D. Ron: On Randomized One-Round Communication Complexity. 27th ACM STOC (1995) 596\u2013605."},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BF01204170","volume":"28","author":"M. Krause","year":"1995","unstructured":"M. Krause, S. Waack: Variation ranks of communication matrices and lower bounds for depth-two circuits having symmetric gates with unbounded fan-in. Math. Sys. Theory 28 (1995) 553\u2013564. (Prelim. version: 32nd IEEE FOGS (1991) 777\u2013782.)","journal-title":"Math. Sys. Theory"},{"key":"2_CR29","unstructured":"L. Lov\u00e1sz: Communication Complexity: A Survey. In: Paths, flows, and VLSI-layout. (B. Korte, ed.) Springer-Verlag, 1990, pp. 235\u2013265."},{"key":"2_CR30","unstructured":"S. V. Lokam: Algebraic Methods in Computational Complexity: Arithmetic Circuits, Communication Complexity, and Interactive Proof Systems. Ph.D. Thesis, University of Chicago, August 1996"},{"key":"2_CR31","doi-asserted-by":"crossref","unstructured":"M. Luby, B. Veli\u010dkovi\u0107, A. Wigderson: Deterministic approximate counting of depth-2 circuits. Proc. 2nd Israel Symp. on Theory and Computing Systems, 1993, pp. 18\u201324.","DOI":"10.1109\/ISTCS.1993.253488"},{"key":"2_CR32","unstructured":"K. Mehlhorn, E.M. Schmidt: Las Vegas is better than determinism in VLSI and distributed computing. 14th ACM STOC (1982) 330\u2013337."},{"key":"2_CR33","unstructured":"M. Naor. Private communication, 1994, cited in [KNR]. [Ne] I. Newman. Private communication, 1994, cited in [KNR]."},{"key":"2_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(91)90157-D","volume":"39","author":"I. Newman","year":"1991","unstructured":"I. Newman: Private vs. common random bits in communication complexity. Info. Proc. Letters 39 (1991) 67\u201371.","journal-title":"Info. Proc. Letters"},{"key":"2_CR35","unstructured":"I. Newman, M. Szegedy: Public vs. Private Coin Flips in One Round Communication Games. 28th ACM STOC (1996) 561\u2013570."},{"key":"2_CR36","volume-title":"Combinatorics, Paul Erd\u0151s is Eighty","author":"N. Nisan","year":"1993","unstructured":"N. Nisan: The communication complexity of threshold gates. In: Combinatorics, Paul Erd\u0151s is Eighty (D. Mikl\u00f3s, T. Sz\u0151nyi, V. T. Sp\u00f3s, eds.), Vol. 1. Bolyai Society Mathematical Studies 1, Budapest 1993(distributed by the A. M. S.), pp. 301\u2013315."},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1137\/0222016","volume":"22","author":"N. Nisan","year":"1993","unstructured":"N. Nisan, A. Wigderson: Rounds in Communication Complexity Revisited. SIAM J. Comp. 22 (1993) 211\u2013219. (Prelim. version: 23rd ACM STOC (1991) 419\u2013429.)","journal-title":"SIAM J. Comp"},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"R. Paturi","year":"1986","unstructured":"R. Paturi and J. Simon: Probabilistic communication complexity. J. Comp. Sys. Sci. 33 (1986) 106\u2013123. (Prelim. version: 25th IEEE FOCS (1984) 118\u2013126.)","journal-title":"J. Comp. Sys. Sci."},{"key":"2_CR39","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BF01215351","volume":"14","author":"P. Pudl\u00e1k","year":"1994","unstructured":"P. Pudl\u00e1k: Large communication in constant depth circuits. Combinatorica 14 (1994) 203\u2013216.","journal-title":"Combinatorica"},{"key":"2_CR40","doi-asserted-by":"crossref","unstructured":"P. Pudl\u00e1k, V. R\u00f6dl, J. Sgall: Boolean circuits, tensor ranks and communication complexity. SIAM J. Comp., to appear.","DOI":"10.1137\/S0097539794264809"},{"key":"2_CR41","doi-asserted-by":"crossref","unstructured":"R. Raz, P. McKenzie: Separation of the Monotone NC Hierarchy. Manuscript, 1997.","DOI":"10.1109\/SFCS.1997.646112"},{"key":"2_CR42","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1145\/146637.146684","volume":"39","author":"R. Raz","year":"1992","unstructured":"R. Raz, A. Wigderson: Monotone circuits for matching require linear depth. J. ACM 39 (1992) 736\u2013744. (Prelim. version: 22nd ACM STOC (1990) 287\u2013292.)","journal-title":"J. ACM"},{"key":"2_CR43","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1109\/18.312169","volume":"40","author":"V. P. Roychowdhury","year":"1994","unstructured":"V. P. Roychowdhury, A. Orlitsky, K. Y. Siu: Lower bounds on threshold and related circuits via communication complexity. IEEE Trans. Info. Theory 40 (1994), 467\u2013474.","journal-title":"IEEE Trans. Info. Theory"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"C. D. Thompson: Area-time complexity for VLSI. 11th ACM STOC (1979), 81\u201388.","DOI":"10.1145\/800135.804401"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"L. G. Valiant: Graph theoretic arguments in low-level complexity. 6th Symp. MFCS (1977),162\u2013176.","DOI":"10.1007\/3-540-08353-7_135"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"F. Vatan: Some lower and upper bounds for algebraic decision trees and the separation problem. 7th IEEE Symp. Structure in Complexity Theory (1992) 295\u2013304.","DOI":"10.1109\/SCT.1992.215404"},{"key":"2_CR47","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF02579325","volume":"7","author":"U.V. Vazirani","year":"1987","unstructured":"U.V. Vazirani: Strong communication complexity or generating quasirandom sequences from two communicating semirandom sources. Combinatorica 7 (1987) 375\u2013392.","journal-title":"Combinatorica"},{"key":"2_CR48","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao. Some Complexity Questions Related to Distributed Computing. Proc. of the 11th ACM STOC, 1979, pp. 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"2_CR49","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao. Lower Bounds by Probabilistic Arguments. Proc. of the 24th IEEE FOCS, 1983, pp. 420\u2013428.","DOI":"10.1109\/SFCS.1983.30"},{"key":"2_CR50","unstructured":"A. C-C. Yao. On ACC and Threshold Circuits. 31st IEEE FOCS (1990) 619\u2013627."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029945","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T01:43:10Z","timestamp":1736127790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029945"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/bfb0029945","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}