{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T00:06:33Z","timestamp":1759190793618,"version":"3.44.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,6,1]],"date-time":"1986-06-01T00:00:00Z","timestamp":517968000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Integration"],"published-print":{"date-parts":[[1986,6]]},"DOI":"10.1016\/s0167-9260(86)80006-2","type":"journal-article","created":{"date-parts":[[2004,11,13]],"date-time":"2004-11-13T11:59:08Z","timestamp":1100347148000},"page":"175-183","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Contributions to VLSI computational complexity theory from bounds on current density"],"prefix":"10.1016","volume":"4","author":[{"given":"H.C.","family":"Card","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Pries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.D.","family":"McLeod","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"year":"1974","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","key":"10.1016\/S0167-9260(86)80006-2_bib1"},{"article-title":"A complexity theory for VLSI","year":"1980","author":"Thompson","key":"10.1016\/S0167-9260(86)80006-2_bib2"},{"key":"10.1016\/S0167-9260(86)80006-2_bib3","series-title":"Proc. 21st Ann. IEEE Symp. on Found. of Comp. Sci","first-page":"294","article-title":"A combinatorial limit to the computing power of VLSI circuits","author":"Vuillemin","year":"1980"},{"year":"1984","series-title":"Computational aspects of VLSI","author":"Ullman","key":"10.1016\/S0167-9260(86)80006-2_bib4"},{"key":"10.1016\/S0167-9260(86)80006-2_bib5","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1109\/JSSC.1982.1051799","article-title":"A critique of network speed in VLSI models of computation","volume":"SC-17","author":"Bilardi","year":"1982","journal-title":"IEEE J. Solid State Ccts."},{"key":"10.1016\/S0167-9260(86)80006-2_bib6","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1109\/JSSC.1979.1051197","article-title":"Cost and performance of VLSI computing structures","volume":"SC-14","author":"Mead","year":"1979","journal-title":"IEEE J. Solid State Ccts."},{"key":"10.1016\/S0167-9260(86)80006-2_bib7","doi-asserted-by":"crossref","first-page":"1047","DOI":"10.1109\/TC.1983.1676155","article-title":"Fourier transforms in VLSI","volume":"C-32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0167-9260(86)80006-2_bib8","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1109\/JSSC.1982.1051729","article-title":"Effects of scaling of interconnections on the time delay of VLSI circuits","volume":"SC-17","author":"Saraswat","year":"1982","journal-title":"IEEE J. Solid State Ccts."},{"key":"10.1016\/S0167-9260(86)80006-2_bib9","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/EDL.1982.25491","article-title":"Speed limitations due to interconnect time constants in VLSI integrated circuits","volume":"EDL-3","author":"Sinha","year":"1982","journal-title":"IEEE Electron Dev. Lett."},{"key":"10.1016\/S0167-9260(86)80006-2_bib10","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1109\/T-ED.1985.22046","article-title":"Optimal interconnection circuits for VLSI","volume":"ED-32","author":"Bakoglu","year":"1985","journal-title":"IEEE Trans. Electron Dev."},{"key":"10.1016\/S0167-9260(86)80006-2_bib11","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.1109\/TC.1984.1676396","article-title":"Concurrent VLSI architectures","volume":"C-33","author":"Seitz","year":"1984","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0167-9260(86)80006-2_bib12","series-title":"Introduction to VLSI Systems","article-title":"System timing","author":"Seitz","year":"1980"},{"key":"10.1016\/S0167-9260(86)80006-2_bib13","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/JSSC.1982.1051810","article-title":"Minimum propagation delays in VLSI","volume":"SC-17","author":"Mead","year":"1982","journal-title":"IEEE J. Solid State Ccts."},{"key":"10.1016\/S0167-9260(86)80006-2_bib14","unstructured":"Card, H.C., P.G. Gulak, R.D. McLeod, and W. Pries, \u03bb, T complexity measures for VLSI computations in constant chip area, IEEE Trans. Computers, submitted for publication."},{"issue":"14","key":"10.1016\/S0167-9260(86)80006-2_bib15","article-title":"LSI in 3-D coming soon","volume":"58","author":"Cohen","year":"1985","journal-title":"Electronics Week"},{"key":"10.1016\/S0167-9260(86)80006-2_bib16","first-page":"740","article-title":"Physical limits in digital electronics","volume":"63","author":"Keyes","year":"1975"},{"key":"10.1016\/S0167-9260(86)80006-2_bib17","first-page":"850","article-title":"Optical interconnections for VLSI systems","volume":"Vol. 72","author":"Goodman","year":"1984"},{"volume":"Vol. 8","year":"1979","author":"d'Huerle","key":"10.1016\/S0167-9260(86)80006-2_bib18"},{"key":"10.1016\/S0167-9260(86)80006-2_bib19","first-page":"550","article-title":"Device, circuit, and technology scaling to micron and submicron dimensions","volume":"71","author":"Reisman","year":"1983"},{"key":"10.1016\/S0167-9260(86)80006-2_bib20","first-page":"185","article-title":"Interconnects\/gates in VLSI technologies","author":"McGreivy","year":"1982"},{"year":"1982","series-title":"Molecular Electronic Devices","key":"10.1016\/S0167-9260(86)80006-2_bib21"},{"article-title":"Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks","year":"1983","author":"Leighton","key":"10.1016\/S0167-9260(86)80006-2_bib22"},{"key":"10.1016\/S0167-9260(86)80006-2_bib23","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","article-title":"The cube-connected cycles: a versatile network for parallel computation","volume":"24","author":"Preparata","year":"1981","journal-title":"Comm. ACM"}],"container-title":["Integration"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926086800062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167926086800062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T09:12:02Z","timestamp":1759137122000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167926086800062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,6]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1986,6]]}},"alternative-id":["S0167926086800062"],"URL":"https:\/\/doi.org\/10.1016\/s0167-9260(86)80006-2","relation":{},"ISSN":["0167-9260"],"issn-type":[{"type":"print","value":"0167-9260"}],"subject":[],"published":{"date-parts":[[1986,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Contributions to VLSI computational complexity theory from bounds on current density","name":"articletitle","label":"Article Title"},{"value":"Integration","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0167-9260(86)80006-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}