{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:23:59Z","timestamp":1725456239278},"publisher-location":"Berlin\/Heidelberg","reference-count":11,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354051516X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0015924","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:25:05Z","timestamp":1132727105000},"page":"12-18","source":"Crossref","is-referenced-by-count":1,"title":["Chomsky hierarchy and communication complexity"],"prefix":"10.1007","author":[{"given":"Galina","family":"Jir\u00e1skov\u00e1","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"A.V. Aho, J.D. Ullman and M. Yannakakis, On notions of information transfer in VLSI circuits. Proc. 15th Ann. ACM Symp. on Theory of Computing (1983) 133\u2013139.","DOI":"10.1145\/800061.808742"},{"issue":"1","key":"2_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(87)90037-X","volume":"73","author":"P. \u010euri\u0161","year":"1987","unstructured":"P. \u010euri\u0161, Z. Galil and G. Schnitger, Lower bounds on communication complexity. Inform. and Comput. 73, 1 (1987) 1\u201322.","journal-title":"Inform. and Comput."},{"key":"2_CR3","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01840352","volume":"1","author":"S. Hornick","year":"1987","unstructured":"S. Hornick and M. Sarrafzatch, On problems transformability in VLSI. Algorithmica 1(1987) 97\u2013112.","journal-title":"Algorithmica"},{"key":"2_CR4","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(88)90165-X","volume":"57","author":"J. Hromkovi\u010d","year":"1988","unstructured":"J. Hromkovi\u010d, The advantages of a new approach to defining the communication complexity for VLSI. Theoret. Comput. Sci. 57 (1988) 97\u2013111.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR5","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(86)90087-3","volume":"48","author":"J. Hromkovi\u010d","year":"1986","unstructured":"J. Hromkovi\u010d, Communication complexity hierarchy. Theoret. Comput. Sci. 48(1986) 109\u2013115.","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR6","unstructured":"J. Hromkovi\u010d, Lower bound techniques for VLSI algorithms. Proc. IMYCS '86, Hungarian Academy of Sciences (1986) 9\u201319."},{"key":"2_CR7","first-page":"311","volume":"48\u201349","author":"J. Hromkovi\u010d","year":"1986","unstructured":"J. Hromkovi\u010d, Relation between Chomsky hierarchy and communication complexity hierarchy. Acta Math. Univ. Comenian. 48\u201349 (1986) 311\u2013317.","journal-title":"Acta Math. Univ. Comenian"},{"key":"2_CR8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/2422.322421","volume":"31","author":"J. J. Ja","year":"1984","unstructured":"J. Ja, Ja and V.K. Prasanna Kumar, Information transfer in distributed computing with applications to VLSI. J. Assoc. Comput. Mach. 31 (1984) 150\u2013162.","journal-title":"J. Assoc. Comput. Mach."},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1137\/0213052","volume":"13","author":"J. J. Ja","year":"1984","unstructured":"J. Ja, Ja, V.K. Prasanna Kumar and J. Simon, Information transfer under different sets of protocols. SIAM J. Comput. 13(1984) 840\u2013849.","journal-title":"SIAM J. Comput."},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Ch. Papadimitriou and M. Sipser, Communication complexity. Proc. 14th Ann. ACM Symp. on Theory of Computing (1982) 196\u2013200.","DOI":"10.1145\/800070.802192"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"A.C. Yao, The entropic limitations of VLSI computations, Proc. 13th Ann. ACM Symp. on Theory of Computing (1981) 308\u2013311.","DOI":"10.1145\/800076.802483"}],"container-title":["Lecture Notes in Computer Science","Machines, Languages, and Complexity"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0015924","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:25:32Z","timestamp":1586579132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0015924"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354051516X"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/bfb0015924","relation":{},"subject":[]}}