{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T08:33:42Z","timestamp":1648802022898},"reference-count":7,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1983,12,1]],"date-time":"1983-12-01T00:00:00Z","timestamp":439084800000},"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":[[1983,12]]},"DOI":"10.1016\/0020-0190(83)90111-4","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T00:11:21Z","timestamp":1027642281000},"page":"263-268","source":"Crossref","is-referenced-by-count":3,"title":["Where-oblivious is not sufficient"],"prefix":"10.1016","volume":"17","author":[{"given":"Reiner","family":"Kolla","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(83)90111-4_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(83)90111-4_BIB2","first-page":"529","article-title":"The area time complexity of binary multiplication","volume":"28","author":"Brent","year":"1979","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0020-0190(83)90111-4_BIB3","article-title":"Untere schranken f\u00fcr VLSI","volume":"Fachbereich 10","author":"Kolla","year":"1982"},{"key":"10.1016\/0020-0190(83)90111-4_BIB4","first-page":"89","article-title":"On the complexity of VLSI computations","author":"Lengauer","year":"1981","journal-title":"Proc. CMU Conf. on VLSI Systems and Comp."},{"key":"10.1016\/0020-0190(83)90111-4_BIB5","first-page":"300","article-title":"Lower bounds for VLSI","author":"Lipton","year":"1981","journal-title":"STOC"},{"key":"10.1016\/0020-0190(83)90111-4_BIB6","series-title":"Ph.D. Thesis","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0020-0190(83)90111-4_BIB7","first-page":"294","article-title":"A combinatorial limit to the computing power of VLSI","author":"Vuillemin","year":"1980","journal-title":"21st Ann. Symp. on Found. of Comp."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083901114?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019083901114?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T12:57:05Z","timestamp":1555073825000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019083901114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,12]]},"references-count":7,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1983,12]]}},"alternative-id":["0020019083901114"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(83)90111-4","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1983,12]]}}}