{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,7]],"date-time":"2024-12-07T05:20:35Z","timestamp":1733548835312,"version":"3.30.1"},"reference-count":11,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,8,1]],"date-time":"1993-08-01T00:00:00Z","timestamp":744163200000},"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":[[1993,8]]},"DOI":"10.1016\/0020-0190(93)90233-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:37:30Z","timestamp":1027654650000},"page":"109-113","source":"Crossref","is-referenced-by-count":20,"title":["An O(1) time optimal algorithm for multiplying matrices on reconfigurable mesh"],"prefix":"10.1016","volume":"47","author":[{"given":"Heonchul","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyoung Joong","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Viktor K.","family":"Prasanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90233-Y_BIB1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0743-7315(91)90084-M","article-title":"The power of reconfiguration","author":"Ben-Asher","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/0020-0190(93)90233-Y_BIB2","series-title":"Tech. Rept. No. 716","article-title":"Optimal simulations in reconfigurable arrays","author":"Ben-Asher","year":"1992"},{"key":"10.1016\/0020-0190(93)90233-Y_BIB3","doi-asserted-by":"crossref","DOI":"10.1109\/FMPC.1992.234952","article-title":"A fast algorithm for computing histogram on reconfigurable mesh","author":"Jang","year":"1992","journal-title":"Proc. Symp. on the Frontiers of Massively Parallel Computation"},{"key":"10.1016\/0020-0190(93)90233-Y_BIB4","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1109\/IPPS.1992.223059","article-title":"An optimal sorting algorithm on reconfigurable mesh","author":"Jang","year":"1992","journal-title":"Proc. Internat. Parallel Processing Symp."},{"key":"10.1016\/0020-0190(93)90233-Y_BIB5","series-title":"Introduction to VLSI Systems","article-title":"Systolic arrays for VLSI","author":"Kung","year":"1979"},{"key":"10.1016\/0020-0190(93)90233-Y_BIB6","doi-asserted-by":"crossref","first-page":"163","DOI":"10.7551\/mitpress\/1102.003.0014","article-title":"Meshes with reconfigurable buses","author":"Miller","year":"1988","journal-title":"Proc. MIT Conf. on Advanced Research in VLSI"},{"issue":"11","key":"10.1016\/0020-0190(93)90233-Y_BIB7","first-page":"3894","article-title":"A sub-logarithmic time sorting algorithm on a reconfigurable mesh","volume":"74","author":"Nakano","year":"1991","journal-title":"IEICE Trans."},{"key":"10.1016\/0020-0190(93)90233-Y_BIB8","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\/0020-0190(93)90233-Y_BIB9","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":"22","author":"Savage","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(93)90233-Y_BIB10","article-title":"Configurational computation: A new computation method on processor arrays with reconfigurable bus systems","author":"Wang","year":"1991","journal-title":"Proc. Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0020-0190(93)90233-Y_BIB11","first-page":"52","article-title":"Constant algorithms for the transitive closure problem and its applications","volume":"Vol. 3","author":"Wang","year":"1990","journal-title":"Proc. Internat. Conf. on Parallel Processing"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390233Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390233Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,6]],"date-time":"2024-12-06T21:39:09Z","timestamp":1733521149000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390233Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,8]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,8]]}},"alternative-id":["002001909390233Y"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90233-y","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1993,8]]}}}