{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T01:43:15Z","timestamp":1648777395580},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1988,4,1]],"date-time":"1988-04-01T00:00:00Z","timestamp":575856000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9238,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,4]]},"DOI":"10.1016\/0304-3975(88)90165-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T21:44:32Z","timestamp":1034286272000},"page":"97-111","source":"Crossref","is-referenced-by-count":8,"title":["The advantages of a new approach to defining the communication complexity for VLSI"],"prefix":"10.1016","volume":"57","author":[{"given":"Juraj","family":"Hromkovi\u010d","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90165-X_BIB1","first-page":"151","article-title":"Lower bounds on information transfer in distributed computations","author":"Abelson","year":"1978","journal-title":"Proc. 19th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90165-X_BIB2","first-page":"133","article-title":"On notions of information transfer in VLSI circuits","author":"Aho","year":"1983","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB3","first-page":"81","article-title":"Lower bounds on communication complexity","author":"\u010euri\u0161","year":"1984","journal-title":"Proc. 15th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB4","series-title":"\u0160VO\u010c 1986","article-title":"Closure properties of communication complexity classes","author":"Gub\u00e1\u0161","year":"1986"},{"key":"10.1016\/0304-3975(88)90165-X_BIB5","first-page":"235","article-title":"Communication complexity","volume":"172","author":"Hromkovi\u010d","year":"1984"},{"issue":"5","key":"10.1016\/0304-3975(88)90165-X_BIB6","first-page":"415","article-title":"Normed protocols and communication complexity","volume":"3","author":"Hromkovi\u010d","year":"1984","journal-title":"Comput. Artificial Intelligence"},{"key":"10.1016\/0304-3975(88)90165-X_BIB7","first-page":"109","article-title":"Relation between Chomsky hierarchy and communication complexity hierarchy","volume":"XLVIII\u2013XLIX","author":"Hromkovi\u010d","year":"1986","journal-title":"Acta Math. Univ. Comenian."},{"key":"10.1016\/0304-3975(88)90165-X_BIB8","first-page":"300","article-title":"Lower bounds for VLSI","author":"Lipton","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB9","first-page":"209","article-title":"Las Vegas is better than determinism in VLSI and distributed computing","author":"Melhorn","year":"1979","journal-title":"Proc. 14th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB10","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1016\/0022-0000(84)90069-2","article-title":"Communication complexity","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(88)90165-X_BIB11","first-page":"118","article-title":"Probabilistic communication complexity","author":"Paturi","year":"1984","journal-title":"Proc. 25th Ann. IEEE Symp. on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(88)90165-X_BIB12","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979","journal-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB13","first-page":"209","article-title":"The entropic limitations on VLSI computations","author":"Yao","year":"1981","journal-title":"Proc. 13th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB14","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979","journal-title":"Proc. 11th Ann. ACM Symp. on Theory of Computing"},{"key":"10.1016\/0304-3975(88)90165-X_BIB15","first-page":"420","article-title":"Lower bounds by probabilistic arguments","author":"Yao","year":"1983","journal-title":"Proc. 24th Ann. IEEE Symp. on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890165X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030439758890165X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T21:59:51Z","timestamp":1555192791000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030439758890165X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1988,4]]}},"alternative-id":["030439758890165X"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90165-x","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,4]]}}}