{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,24]],"date-time":"2026-02-24T05:34:55Z","timestamp":1771911295880,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1984,10,1]],"date-time":"1984-10-01T00:00:00Z","timestamp":465436800000},"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":10516,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,10]]},"DOI":"10.1016\/0022-0000(84)90033-3","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"243-273","source":"Crossref","is-referenced-by-count":14,"title":["The performance of multilective VLSI algorithms"],"prefix":"10.1016","volume":"29","author":[{"given":"John E.","family":"Savage","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90033-3_BIB1","series-title":"Proceedings, 11th ACM Ann. Sympos. Theory of Comput.","first-page":"81","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1979"},{"issue":"3","key":"10.1016\/0022-0000(84)90033-3_BIB2","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1145\/322261.322269","article-title":"The area-time complexity of binary multiplication","volume":"28","author":"Brent","year":"1981","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90033-3_BIB3","series-title":"VLSI Systems and Computations","first-page":"89","article-title":"On the complexity of VLSI computations","author":"Lengauer","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB4","series-title":"VLSI Systems and Computations","first-page":"61","article-title":"Planar circuit complexity and the performance of VLSI algorithms","author":"Savage","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB5","series-title":"VLSI Systems and Computations","article-title":"Replication of inputs may save computational resources in VLSI","author":"Kedem","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB6","series-title":"Procs. 22nd Ann. Sympos. on Found. Comput. Sci.","first-page":"37","article-title":"On relations between input and communication\/computation in VLSI","author":"Kedem","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB7","series-title":"Proceedings 13th Ann. ACM Sympos. on Theory of Computing","first-page":"308","article-title":"The entropic limitations on VLSI computations","author":"Yao","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB8","article-title":"A Complexity Theory for VLSI","author":"Thompson","year":"1980"},{"key":"10.1016\/0022-0000(84)90033-3_BIB9","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\/0022-0000(84)90033-3_BIB10","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1016\/0022-0000(81)90029-5","article-title":"Area-time tradeoffs for matrix multiplication and related problems in VLSI models","volume":"23","author":"Savage","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90033-3_BIB11","series-title":"Proceedings 21st Ann. Sympos. Found. Comput. Sci.","first-page":"294","article-title":"A combinatorial limit to the computing power of VLSI Circuits","author":"Vuillemin","year":"1980"},{"key":"10.1016\/0022-0000(84)90033-3_BIB12","series-title":"Proceedings, 13th Ann. ACM Sympos. on Theory of Computing","first-page":"300","article-title":"Lower bounds for VLSI","author":"Lipton","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB13","unstructured":"L. G. Valiant, personal communication."},{"key":"10.1016\/0022-0000(84)90033-3_BIB14","unstructured":"Z. Kedem, personal communication."},{"key":"10.1016\/0022-0000(84)90033-3_BIB15","first-page":"35","article-title":"An application of separability and independence notions for proving lower bounds of circuit complexity","volume":"60","author":"Grigoryev","year":"1976","journal-title":"Notes of Scientific Seminars, Steklov Math. Inst."},{"key":"10.1016\/0022-0000(84)90033-3_BIB16","series-title":"Proceedings, Third Hungarian Conf. on Comput. Sci.","first-page":"93","article-title":"Space-time tradeoffs\u2014A survey","author":"Savage","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB17","series-title":"Introd. to VLSI Systems","first-page":"271","article-title":"Algorithms for VLSI processor arrays","author":"Kung","year":"1980"},{"key":"10.1016\/0022-0000(84)90033-3_BIB18","unstructured":"G. M. Baudet, personal communication."},{"key":"10.1016\/0022-0000(84)90033-3_BIB19","unstructured":"C. A. Heintz, personal communication."},{"issue":"2","key":"10.1016\/0022-0000(84)90033-3_BIB20","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","article-title":"A separator theorem for planar graphs","volume":"36","author":"Lipton","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0022-0000(84)90033-3_BIB21","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0022-0000(84)90033-3_BIB22","series-title":"Proceedings, 22nd Ann. Sympos. on Found. of Comput. Sci.","first-page":"1","article-title":"New lower bound techniques for VLSI","author":"Leighton","year":"1981"},{"key":"10.1016\/0022-0000(84)90033-3_BIB23","unstructured":"A. Aggrawal, personal communication."},{"key":"10.1016\/0022-0000(84)90033-3_BIB24","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68402-9_8","article-title":"Planar Circuit Complexity and the Performance of VLSI Algorithms","author":"Savage","year":"1981"},{"issue":"4","key":"10.1016\/0022-0000(84)90033-3_BIB25","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1145\/321724.321731","article-title":"Computational work and time on finite machines","volume":"19","author":"Savage","year":"1972","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"10.1016\/0022-0000(84)90033-3_BIB26","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0022-0000(80)90056-2","article-title":"Time-space tradeoffs for computing functions, using connectivity properties of their circuits","volume":"20","author":"Tompa","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(84)90033-3_BIB27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1007\/3-540-09510-1_40","article-title":"Space-time tradeoffs for oblivious integer multiplication","author":"Savage","year":"1979"},{"key":"10.1016\/0022-0000(84)90033-3_BIB28","series-title":"12th Ann. ACM Sympos. on Theory of Computing","first-page":"339","article-title":"Time-space tradeoffs for some algebraic problems","author":"Ja'Ja'","year":"1980"},{"issue":"2","key":"10.1016\/0022-0000(84)90033-3_BIB29","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/62.69","article-title":"Space-time tradeoffs for banded matrix problems","volume":"31","author":"Savage","year":"1984","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(84)90033-3_BIB30","series-title":"Procs. 11th ACM Ann. Sympos. Theory of Comput.","first-page":"209","article-title":"Some complexity questions related to distributive computing","author":"Yao","year":"1979"},{"key":"10.1016\/0022-0000(84)90033-3_BIB31","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0022-0000(84)90033-3_BIB32","series-title":"Introduction to VLSI Systems","author":"Mead","year":"1980"},{"issue":"2","key":"10.1016\/0022-0000(84)90033-3_BIB33","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":"Preparata","year":"1980","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(84)90033-3_BIB34","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1109\/TIT.1978.1055938","article-title":"Space-time tradeoffs on the FFT algorithm","volume":"IT-24","author":"Savage","year":"1978","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0022-0000(84)90033-3_BIB35","series-title":"14th. Ann. ACM Sympos. on Theory of Comput.","first-page":"77","article-title":"How to assemble tree machines","author":"Bhatt","year":"1982"},{"key":"10.1016\/0022-0000(84)90033-3_BIB36","series-title":"14th Ann. ACM Sympos. on Theory of Comput.","first-page":"85","article-title":"A layout strategy for VLSI which is provably good","author":"Leighton","year":"1982"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900333?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900333?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:44Z","timestamp":1550325104000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900333"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,10]]},"references-count":36,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,10]]}},"alternative-id":["0022000084900333"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90033-3","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,10]]}}}