{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T13:10:16Z","timestamp":1736082616847,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540167838"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0016268","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T05:39:17Z","timestamp":1131860357000},"page":"431-439","source":"Crossref","is-referenced-by-count":1,"title":["A new approach to defining the communication complexity for VLSI"],"prefix":"10.1007","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Abelson, H.: Lower bounds on information transfer in distributed computations. Proc. 19th Annual IEEE FOCS, 1978, pp.151\u2013158","DOI":"10.1109\/SFCS.1978.22"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Aho,A.V. \u2014 Ullman, J.D. \u2014 Yanakakis,M.: On notions of information transfer in VLSI circuits. Proc. 14th Annual ACM STOC, 1983, pp.133\u2013139.","DOI":"10.1145\/800061.808742"},{"key":"39_CR3","doi-asserted-by":"crossref","unstructured":"\u010euri\u0161,P. \u2014 Galil,Z. \u2014 Schnitger,G.: Lower bounds on communication complexity. Proc. 15th Annual ACM STOC, 1984, pp.81\u201391.","DOI":"10.1145\/800057.808668"},{"key":"39_CR4","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/3-540-13345-3_21","volume":"172","author":"J. Hromkovi\u010d","year":"1984","unstructured":"Hromkovi\u010d, J.: Communication complexity. Proc. 11th ICALP, Lecture Notes in Computer Science 172, Springer-Verlag 1984, pp.235\u2013246","journal-title":"Lecture Notes in Computer Science"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Hromkovi\u010d,J.: Relation between Chomsky hierarchy and communication complexity hierarchy. Acta Mathematica Universtatis Comenianae 1986, to appear","DOI":"10.1016\/0304-3975(86)90087-3"},{"issue":"5","key":"39_CR6","first-page":"415","volume":"3","author":"J. Hromkovi\u010d","year":"1984","unstructured":"Hromkovi\u010d, J.: Normed protocol and communication complexity. Computers and Artificial Intelligence 3, No.5, 1984, 415\u2013422.","journal-title":"Computers and Artificial Intelligence"},{"key":"39_CR7","doi-asserted-by":"crossref","unstructured":"Lipton,R.J. \u2014 Sedgewick,R.: Lower bounds for VLSI. Proc. 13th Annual ACM STOC, 1981, 300\u2013307.","DOI":"10.1145\/800076.802482"},{"key":"39_CR8","unstructured":"Melhorn,K. \u2014 Schmidt,E.M.: Las Vegas is better than determinism in VLSI and distributed computing. Proc. 14th Annual ACM STOC, 1979, pp.209\u2013213"},{"key":"39_CR9","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","volume":"28","author":"C.H. Papadimitriou","year":"1984","unstructured":"Papadimitriou, C.H. \u2014 Sipser, M.: Communication complexity. Journal of Computer and System Sciences 28, 1984, 260\u2013269.","journal-title":"Journal of Computer and System Sciences"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Paturi,R. \u2014 Simon,J.: Probabilistic communication complexity. Proc. 25th Annual IEEE FOCS, 1984, pp.118\u2013126","DOI":"10.1109\/SFCS.1984.715908"},{"key":"39_CR11","unstructured":"\u0160kalikova,N.A.: Kleto\u010dnyje avtomaty in Russian. Ph.D. thesis, Moscow State University, Dept. of Mathematical Cybernetics, 1979"},{"key":"39_CR12","doi-asserted-by":"crossref","unstructured":"Thompson,C.D.: Area-time complexity for VLSI. Proc. 11th Annual ACM STOC, 1979, pp.209\u2013213","DOI":"10.1145\/800135.804401"},{"key":"39_CR13","doi-asserted-by":"crossref","unstructured":"Yao,A.C.: The entropic limitation on VLSI computations. Proc. 13th Annual ACM STOC, 1979, pp.209\u2013213","DOI":"10.1145\/800135.804414"},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"Yao,A.C.: Some complexity question related to distributed computing. Proc. 11th Annual ACM STOC, 1979, pp.209\u2013213","DOI":"10.1145\/800135.804414"},{"key":"39_CR15","doi-asserted-by":"crossref","unstructured":"Yao,A.C.: Lower bounds by probabilistic arguments. Proc. 24th Annual IEEE FOCS, 1983, pp.420\u2013428.","DOI":"10.1109\/SFCS.1983.30"},{"key":"39_CR16","unstructured":"Gub\u00e1\u0161,X. \u2014 Vaczul\u00edk,J.: Closure properties of the families of languages defined by communication complexity. \u0160VO\u010c 1986, Komensk\u00fd University, Bratislava, Dept. of Theoretical Cybernetics and Mathematical Informatics 1986 (in Slovak)"},{"key":"39_CR17","unstructured":"Kurcabov\u00e1,V.: Communication complexity. Diplom thesis, Komensk\u00fd University, Bratislava, Dept. of Theoretical Cybernetics and Mathematical Informatics 1986 (in Slovak)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1986"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0016268.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T12:57:19Z","timestamp":1736081839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0016268"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540167838"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0016268","relation":{},"subject":[]}}