{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T15:57:12Z","timestamp":1726415832048},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1993,11,1]],"date-time":"1993-11-01T00:00:00Z","timestamp":752112000000},"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":7198,"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":[[1993,11]]},"DOI":"10.1016\/0304-3975(93)90288-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"215-227","source":"Crossref","is-referenced-by-count":10,"title":["Deriving algorithms on reconfigurable networks based on function decomposition"],"prefix":"10.1016","volume":"120","author":[{"given":"Gen-Huey","family":"Chen","sequence":"first","affiliation":[]},{"given":"Biing-Feng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Hungwen","family":"Li","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0304-3975(93)90288-5_BIB1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1109\/TC.1986.1676658","article-title":"Optimal bounds for finding maximum on array of processors with k global buses","volume":"C-35","author":"Aggarwal","year":"1986","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0304-3975(93)90288-5_BIB2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0743-7315(91)90084-M","article-title":"The power of reconfiguration","volume":"13","author":"Ben-Asher","year":"1991","journal-title":"J. Parallel Distributed Comput."},{"issue":"2","key":"10.1016\/0304-3975(93)90288-5_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TC.1984.1676405","article-title":"Finding maximum on an array processor with a global buses","volume":"C-33","author":"Bokhari","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0304-3975(93)90288-5_BIB4","first-page":"70","article-title":"Immediate parallel solution of the longest common subsequence problem","author":"Champion","year":"1987","journal-title":"Proc. 1987 Internat. Conf. on Parallel Processing"},{"year":"1988","series-title":"Optical Computing","author":"Feitelson","key":"10.1016\/0304-3975(93)90288-5_BIB5"},{"year":"1989","series-title":"Concrete Mathematics","author":"Graham","key":"10.1016\/0304-3975(93)90288-5_BIB6"},{"key":"10.1016\/0304-3975(93)90288-5_BIB7","first-page":"279","article-title":"Configurable hardware: a new paradigm for computation","author":"Gray","year":"1989","journal-title":"Proc. 10th Caltech. Conf. on VLSI"},{"key":"10.1016\/0304-3975(93)90288-5_BIB8","article-title":"Mesh-connected array processors with bypass capability for signal\/image processing","author":"Kim","year":"1988","journal-title":"Proc. Hawaii Conf. on System Science"},{"issue":"9","key":"10.1016\/0304-3975(93)90288-5_BIB9","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1109\/12.29479","article-title":"Polymorphic-torus network","volume":"C-38","author":"Li","year":"1989","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"10.1016\/0304-3975(93)90288-5_BIB10","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0743-7315(89)90022-1","article-title":"Connection autonomy in SIMD computers: a VLSI implementation","volume":"7","author":"Maresca","year":"1989","journal-title":"J. Parallel and Distributed Comput."},{"key":"10.1016\/0304-3975(93)90288-5_BIB11","first-page":"204","article-title":"Multicast routing in spanning bus hypercubes","volume":"Vol. 2","author":"Mckinley","year":"1988","journal-title":"Proc. 1988 Internat. Conf. on Parallel Processing"},{"key":"10.1016\/0304-3975(93)90288-5_BIB12","first-page":"205","article-title":"Data movement operations and applications on reconfigurable VLSI arrays","volume":"Vol. 1","author":"Miller","year":"1988","journal-title":"Proc. Internat. Conf. on Parallel Processing"},{"issue":"1","key":"10.1016\/0304-3975(93)90288-5_BIB13","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/S0019-9958(79)90361-9","article-title":"Bus automata and immediate languages","volume":"40","author":"Moshell","year":"1979","journal-title":"Inform. and Control"},{"year":"1972","series-title":"An Introduction to the Theory of Numbers","author":"Niven","key":"10.1016\/0304-3975(93)90288-5_BIB14"},{"issue":"2","key":"10.1016\/0304-3975(93)90288-5_BIB15","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0743-7315(87)90003-7","article-title":"Array processor with multiple broadcasting","volume":"4","author":"Prasanna Kumar","year":"1987","journal-title":"J. Parallel and Distributed Comput."},{"key":"10.1016\/0304-3975(93)90288-5_BIB16","series-title":"Proc. IFAC Symp., Control Aspects of Prostetics and Orthotics","first-page":"87","article-title":"Toward pattern-recognizing visual prostheses","author":"Rothstein","year":"1982"},{"key":"10.1016\/0304-3975(93)90288-5_BIB17","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1109\/21.17370","article-title":"Bus automata, brains, and mental models","volume":"4","author":"Rothstein","year":"1988","journal-title":"IEEE Trans. Systems, Man Cybernet."},{"key":"10.1016\/0304-3975(93)90288-5_BIB18","doi-asserted-by":"crossref","DOI":"10.1109\/JCIT.1990.128289","article-title":"Algorithms and optic implementation for reconfigurable networks","author":"Schuster","year":"1990","journal-title":"Proc. 5th Jerusalem Conf. on Information Technology"},{"key":"10.1016\/0304-3975(93)90288-5_BIB19","article-title":"A content-addressable, bit-serial associative processor","author":"Shu","year":"1988","journal-title":"Proc. IEEE Workshop on VLSI Signal Processing"},{"key":"10.1016\/0304-3975(93)90288-5_BIB20","series-title":"Concurrent Computations","article-title":"The gated interconnection network for dynamic programming","author":"Shu","year":"1988"},{"key":"10.1016\/0304-3975(93)90288-5_BIB21","doi-asserted-by":"crossref","unstructured":"B.F. Wang and G.H. Chen, Constant time algorithms for the transitive closure problem and some related graph problems on processor arrays with reconfigurable bus systems, IEEE Transactions on Parallel and Distributed Systems, 1, 500\u2013507.","DOI":"10.1109\/71.80177"},{"key":"10.1016\/0304-3975(93)90288-5_BIB22","first-page":"42","article-title":"Configurational computation: a new computation method on processor arrays with reconfigurable bus systems","volume":"Vol. 3","author":"Wang","year":"1991","journal-title":"Proc. Internat. Conf. on Parallel Processing"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593902885?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397593902885?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:40:37Z","timestamp":1621032037000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397593902885"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,11]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,11]]}},"alternative-id":["0304397593902885"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(93)90288-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[1993,11]]}}}