{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:00:14Z","timestamp":1757541614183},"reference-count":6,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,10,1]],"date-time":"1980-10-01T00:00:00Z","timestamp":339206400000},"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":[[1980,10]]},"DOI":"10.1016\/0020-0190(80)90006-x","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"77-80","source":"Crossref","is-referenced-by-count":47,"title":["Area-time optimal VLSI networks for multiplying matrices"],"prefix":"10.1016","volume":"11","author":[{"given":"Franco P.","family":"Preparata","sequence":"first","affiliation":[]},{"given":"Jean E.","family":"Vuillemin","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(80)90006-X_BIB1","article-title":"Area-time tradeoffs for matrix multiplication and transitive closure in the VLSI model","author":"Savage","year":"1979","journal-title":"Proc. 17th Annual Allerton Conference on Communications, Control and Computing"},{"key":"10.1016\/0020-0190(80)90006-X_BIB2","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"key":"10.1016\/0020-0190(80)90006-X_BIB3","series-title":"Research Report CMU-CS-79-136","article-title":"The area-time complexity of binary multiplication","author":"Brent","year":"1979"},{"key":"10.1016\/0020-0190(80)90006-X_BIB4","series-title":"Ph.D. Thesis","article-title":"A complexity theory for VLSI","author":"Thompson","year":"1979"},{"key":"10.1016\/0020-0190(80)90006-X_BIB5","article-title":"Algorithms of VLSI processor arrays","author":"Kung","year":"1978","journal-title":"Symposium on Sparse Matrix Computations"},{"key":"10.1016\/0020-0190(80)90006-X_BIB6","series-title":"Introduction to Computer Architecture","first-page":"375","article-title":"Overlap and pipeline processing","author":"Chen","year":"1975"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908090006X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001908090006X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:51:21Z","timestamp":1555087881000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001908090006X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,10]]},"references-count":6,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,10]]}},"alternative-id":["002001908090006X"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(80)90006-x","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1980,10]]}}}