{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:22:54Z","timestamp":1757629374953,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,1,1]],"date-time":"1990-01-01T00:00:00Z","timestamp":631152000000},"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":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1990,1]]},"DOI":"10.1016\/0743-7315(90)90068-z","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"52-59","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Area-time trade-offs for matrix-vector multiplication"],"prefix":"10.1016","volume":"8","author":[{"given":"B.","family":"Codenotti","sequence":"first","affiliation":[]},{"given":"G.","family":"Lotti","sequence":"additional","affiliation":[]},{"given":"F.","family":"Romani","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90068-Z_BIB1","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1145\/62.70","article-title":"The VLSI complexity of selected graph problems","volume":"31","author":"J\u00e1j\u00e1","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0743-7315(90)90068-Z_BIB2","series-title":"Introduction to VLSI Systems","first-page":"271","article-title":"Algorithms of VLSI processor arrays","author":"Kung","year":"1980"},{"key":"10.1016\/0743-7315(90)90068-Z_BIB3","series-title":"Proc. 22nd Annual IEEE Symposium on Foundations of Computer Science","first-page":"1","article-title":"New lower bound tecniques for VLSI","author":"Leigthon","year":"1981"},{"key":"10.1016\/0743-7315(90)90068-Z_BIB4","series-title":"Proc. 21st Annual IEEE Symposium on Foundations of Computer Science","first-page":"270","article-title":"Area-efficient graph layouts (for VLSI)","author":"Leiserson","year":"1980"},{"key":"10.1016\/0743-7315(90)90068-Z_BIB5","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/0020-0190(80)90006-X","article-title":"Area-time optimal VLSI networks for multiplying matrices","volume":"11","author":"Prearata","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0743-7315(90)90068-Z_BIB6","series-title":"International Conference on Parallel Processing","first-page":"211","article-title":"Optimal integrated circuit implementation of triangular matrix inversion","author":"Preparata","year":"1980"},{"key":"10.1016\/0743-7315(90)90068-Z_BIB7","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0022-0000(81)90029-5","article-title":"Area-time tradeoffs for matrix multiplications and related problems in VLSI models","volume":"22","author":"Savage","year":"1981","journal-title":"J. Comput. System Sci."},{"year":"1980","series-title":"Introduction to Numerical Analysis","author":"Stoer","key":"10.1016\/0743-7315(90)90068-Z_BIB8"},{"key":"10.1016\/0743-7315(90)90068-Z_BIB9","series-title":"Proc. 11th Annual ACM Symposium on Theory ofComputing","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090068Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090068Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:08Z","timestamp":1757514608000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159090068Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,1]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,1]]}},"alternative-id":["074373159090068Z"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90068-z","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Area-time trade-offs for matrix-vector multiplication","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(90)90068-Z","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}