{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T18:15:26Z","timestamp":1648577726968},"reference-count":14,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,2,1]],"date-time":"1998-02-01T00:00:00Z","timestamp":886291200000},"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":["Microprocessors and Microsystems"],"published-print":{"date-parts":[[1998,2]]},"DOI":"10.1016\/s0141-9331(97)00050-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T18:50:06Z","timestamp":1027623006000},"page":"291-298","source":"Crossref","is-referenced-by-count":0,"title":["Ring-connected trees: a multipurpose VLSI architecture for parallel processing"],"prefix":"10.1016","volume":"21","author":[{"given":"S.K.","family":"Basu","sequence":"first","affiliation":[]},{"given":"J.","family":"Dattagupta","sequence":"additional","affiliation":[]},{"given":"R.","family":"Dattagupta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0141-9331(97)00050-1_BIB1","article-title":"Layout for the shuffle-exchange graph and lower bound techniques for VLSI","author":"Leighton","year":"1981"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB2","article-title":"Area-time complexity for VLSI","author":"Thompson","year":"1984"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB3","series-title":"Proc. 5th Computer Architecture Symposium","first-page":"144","article-title":"X-tree: a tree structured multiprocessor computer architecture","author":"Despain","year":"1978"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB4","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1109\/TC.1981.1675731","article-title":"Hypertree: a multiprocessor interconnection topology","author":"Goodman","year":"1981","journal-title":"IEEE Trans. Computers"},{"issue":"6","key":"10.1016\/S0141-9331(97)00050-1_BIB5","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1109\/TC.1983.1676279","article-title":"Efficient VLSI networks for parallel processing based on orthogonal trees","volume":"32","author":"Nath","year":"1983","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB6","series-title":"Proc. IEEE Region 10 Conf. on Computer and Communication Systems","first-page":"514","article-title":"DHT: diagonally hybridized tree is an efficient VLSI structure for parallel computation","author":"Basu","year":"1990"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB7","series-title":"Proc. CSI-90","first-page":"145","article-title":"Parallel processing with lateral hybridization of trees","author":"Basu","year":"1990"},{"issue":"6","key":"10.1016\/S0141-9331(97)00050-1_BIB8","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1109\/TC.1984.1676483","article-title":"Fault tolerance in binary tree architectures","volume":"33","author":"Raghavendra","year":"1984","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB9","series-title":"Proc. Int. Conf. on High Performance Computing","first-page":"226","article-title":"Parallel processing with ring connected trees","author":"Basu","year":"1995"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0165-6074(95)00015-G","article-title":"On synthesizing cube and tree for parallel processing","volume":"41","author":"Basu","year":"1995","journal-title":"Microproc. Microprog."},{"key":"10.1016\/S0141-9331(97)00050-1_BIB11","series-title":"VLSI Signal Processing System","author":"Swartzlander","year":"1986"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB12","series-title":"Proc. IEEE Int. Symp. on Circuits and Systems","first-page":"2104","article-title":"Tree-based VLSI architecture with application to signal processing","author":"Basu","year":"1991"},{"key":"10.1016\/S0141-9331(97)00050-1_BIB13","series-title":"Digital Signal Processing in VLSI","author":"Higgins","year":"1990"},{"issue":"2","key":"10.1016\/S0141-9331(97)00050-1_BIB14","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1109\/TC.1987.1676889","article-title":"A VLSI implementation of the simplex algorithm","volume":"38","author":"Bertossi","year":"1987","journal-title":"IEEE Trans. Computers"}],"container-title":["Microprocessors and Microsystems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933197000501?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0141933197000501?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T15:52:41Z","timestamp":1555602761000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0141933197000501"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,2]]},"references-count":14,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,2]]}},"alternative-id":["S0141933197000501"],"URL":"https:\/\/doi.org\/10.1016\/s0141-9331(97)00050-1","relation":{},"ISSN":["0141-9331"],"issn-type":[{"value":"0141-9331","type":"print"}],"subject":[],"published":{"date-parts":[[1998,2]]}}}