{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T20:02:33Z","timestamp":1648929753190},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,7,1]],"date-time":"1983-07-01T00:00:00Z","timestamp":425865600000},"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":10974,"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":[[1983,7]]},"DOI":"10.1016\/0304-3975(83)90044-0","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T17:49:49Z","timestamp":1034272189000},"page":"123-130","source":"Crossref","is-referenced-by-count":4,"title":["Unbounded hardware is equivalent to deterministic turing machines"],"prefix":"10.1016","volume":"24","author":[{"given":"Bernard","family":"Chazelle","sequence":"first","affiliation":[]},{"given":"Louis","family":"Monier","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90044-0_BIB1","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1975"},{"key":"10.1016\/0304-3975(83)90044-0_BIB2","series-title":"Technical Report","article-title":"A parallel algorithm for constructing minimum spanning trees","author":"Bentley","year":"1979"},{"key":"10.1016\/0304-3975(83)90044-0_BIB3","first-page":"190","article-title":"The chip complexity of binary arithmetic","author":"Brent","year":"1980","journal-title":"Proc. 12th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(83)90044-0_BIB4","doi-asserted-by":"crossref","unstructured":"R.P. Brent and H.T. Kung, The area-time complexity of binary multiplication, J. ACM (to appear).","DOI":"10.1145\/322261.322269"},{"key":"10.1016\/0304-3975(83)90044-0_BIB5","article-title":"A model of computation for VLSI with related complexity results","author":"Chazelle","year":"1981","journal-title":"Proc. 13th Annual ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(83)90044-0_BIB6","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/0304-3975(83)90044-0_BIB7","first-page":"140","article-title":"The cube-connected-cycles: A versatile network for parallel computation","author":"Preparata","year":"1978","journal-title":"Proc. 20th IEEE Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0304-3975(83)90044-0_BIB8","series-title":"Technical Report CS-50","article-title":"Area-time tradeoffs for matrix multiplication and related problems in VLSI models","author":"Savage","year":"1979"},{"key":"10.1016\/0304-3975(83)90044-0_BIB9","article-title":"Fourier transforms in VLSI","author":"Thompson","year":"1980","journal-title":"Proc. 1980 IEEE International Conference on Circuits and Computers"},{"key":"10.1016\/0304-3975(83)90044-0_BIB10","series-title":"Ph.D. Thesis","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0304-3975(83)90044-0_BIB11","first-page":"294","article-title":"A combinatorial limit to the computing power of VLSI circuits","author":"Vuillemin","year":"1980","journal-title":"Proc. 21st IEEE Annual Symposium on Foundations of Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900440?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583900440?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:52:08Z","timestamp":1555177928000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583900440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,7]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,7]]}},"alternative-id":["0304397583900440"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90044-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,7]]}}}