{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:12:34Z","timestamp":1648955554820},"reference-count":20,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0020-0190(91)90033-e","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:38:59Z","timestamp":1027654739000},"page":"137-141","source":"Crossref","is-referenced-by-count":0,"title":["Semelectivity is not sufficient"],"prefix":"10.1016","volume":"37","author":[{"given":"Pavol","family":"\u010euri\u0161","sequence":"first","affiliation":[]},{"given":"Imrich","family":"Vr\u0165o","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0020-0190(91)90033-E_BIB1","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/358808.358814","article-title":"Information transfer and area-time tradeoffs for VLSI multiplication","volume":"23","author":"Abelson","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(91)90033-E_BIB2","series-title":"VLSI Systems and Computations","first-page":"100","article-title":"On the area required by VLSI circuits","author":"Baudet","year":"1981"},{"key":"10.1016\/0020-0190(91)90033-E_BIB3","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF01840437","article-title":"Area-time lower bound technique with application to sorting","volume":"1","author":"Bilardi","year":"1986","journal-title":"Algorithmica"},{"issue":"3","key":"10.1016\/0020-0190(91)90033-E_BIB4","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The chip complexity of binary arithmetic","volume":"28","author":"Brent","year":"1981","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/0020-0190(91)90033-E_BIB5","first-page":"535","article-title":"Tight area bounds for sorting","volume":"4","author":"\u010euri\u0161","year":"1985","journal-title":"Comput. Artificial Intelligence"},{"issue":"5","key":"10.1016\/0020-0190(91)90033-E_BIB6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0020-0190(85)90092-4","article-title":"Tight chip area bound for discrete Fourier and Walsh-Hadamard transformations","volume":"21","author":"\u010euri\u0161","year":"1985","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/0020-0190(91)90033-E_BIB7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01840362","article-title":"A minimum area for l-selection","volume":"2","author":"\u010euri\u0161","year":"1987","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/0020-0190(91)90033-E_BIB8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01840352","article-title":"On problem transformability in VLSI","volume":"2","author":"Hornick","year":"1987","journal-title":"Algorithmica"},{"issue":"1","key":"10.1016\/0020-0190(91)90033-E_BIB9","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1145\/2422.322421","article-title":"Information transfer in distributed computing with application to VLSI","volume":"31","author":"Ja'Ja'","year":"1984","journal-title":"J. ACM"},{"issue":"6","key":"10.1016\/0020-0190(91)90033-E_BIB10","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0020-0190(83)90111-4","article-title":"Where oblivious is not sufficient","volume":"17","author":"Kolla","year":"1983","journal-title":"Inform. Process Lett."},{"key":"10.1016\/0020-0190(91)90033-E_BIB11","first-page":"71","article-title":"Tight bounds on the complexity of parallel sorting","author":"Leighton","year":"1984","journal-title":"Proc. 16th Annual Symposium on Theory of Computing"},{"key":"10.1016\/0020-0190(91)90033-E_BIB12","series-title":"VLSI Systems and Computations","first-page":"89","article-title":"On the complexity of VLSI computations","author":"Lengauer","year":"1981"},{"key":"10.1016\/0020-0190(91)90033-E_BIB13","series-title":"Planar circuit complexity and the performance of VLSI algorithms","author":"Savage","year":"1981"},{"key":"10.1016\/0020-0190(91)90033-E_BIB14","series-title":"VLSI Systems and Computations","first-page":"61","article-title":"Planar circuit complexity and the performance of VLSI algorithms","author":"Savage","year":"1981"},{"issue":"4","key":"10.1016\/0020-0190(91)90033-E_BIB15","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1109\/TC.1985.5009386","article-title":"A minimum storage sorting networks","volume":"34","author":"Siegel","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(91)90033-E_BIB16","series-title":"Ph.D. Thesis","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0020-0190(91)90033-E_BIB17","series-title":"Computational Aspects of VLSI","author":"Ullman","year":"1984"},{"issue":"2","key":"10.1016\/0020-0190(91)90033-E_BIB18","article-title":"Area complexity of VISI computations over a ring of integers modulo m","volume":"7","author":"Vr\u0165o","year":"1988","journal-title":"Comput. Artificial Intelligence"},{"issue":"3","key":"10.1016\/0020-0190(91)90033-E_BIB19","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1109\/TC.1983.1676221","article-title":"A combinatorial limit to the computing power of VLSI circuits","volume":"32","author":"Vuillemin","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0190(91)90033-E_BIB20","first-page":"308","article-title":"The entropic limitation of VLSI computations","author":"Yao","year":"1981","journal-title":"Proc. 13th Annual Symposium on Theory of Computing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190033E?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190033E?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T08:23:36Z","timestamp":1555143816000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190033E"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["002001909190033E"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90033-e","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}