{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T03:15:25Z","timestamp":1649214925092},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"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":["Journal of Systems Architecture"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1016\/j.sysarc.2004.08.001","type":"journal-article","created":{"date-parts":[[2004,12,31]],"date-time":"2004-12-31T12:45:15Z","timestamp":1104497115000},"page":"207-222","source":"Crossref","is-referenced-by-count":4,"title":["More on rearrangeability of combined (2n\u22121)-stage networks"],"prefix":"10.1016","volume":"51","author":[{"given":"Nabanita","family":"Das","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/j.sysarc.2004.08.001_bib1","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/35.747249","article-title":"Optical multistage interconnection networks: new challenges and approaches","volume":"37","author":"Pan","year":"1999","journal-title":"IEEE Commun. Mag."},{"issue":"5","key":"10.1016\/j.sysarc.2004.08.001_bib2","doi-asserted-by":"crossref","first-page":"1481","DOI":"10.1002\/j.1538-7305.1962.tb03990.x","article-title":"On rearrangeable three-stage connecting networks","volume":"XLI","author":"Benes","year":"1962","journal-title":"The Bell Sys. Technical J."},{"issue":"5","key":"10.1016\/j.sysarc.2004.08.001_bib3","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1109\/TC.1981.1675791","article-title":"A self-routing Benes network and parallel permutation algorithms","volume":"30","author":"Nassimi","year":"1982","journal-title":"IEEE Trans. Comput. C"},{"key":"10.1016\/j.sysarc.2004.08.001_bib4","doi-asserted-by":"crossref","first-page":"1057","DOI":"10.1109\/12.83649","article-title":"On self-routing in Benes and shuffle-exchange networks","volume":"40","author":"Raghavendra","year":"1991","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"10.1016\/j.sysarc.2004.08.001_bib5","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/S1383-7621(99)00022-3","article-title":"O(n) routing in rearrangeable networks","volume":"46","author":"Das","year":"2000","journal-title":"J. Syst. Architect."},{"issue":"1","key":"10.1016\/j.sysarc.2004.08.001_bib6","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/12.559812","article-title":"Topologies of combined (2logN\u22121)-stage interconnection networks","volume":"46","author":"Hu","year":"1997","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/j.sysarc.2004.08.001_bib7","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1006\/jpdc.1999.1595","article-title":"Permutation capability of optical multistage interconnection networks","volume":"60","author":"Yang","year":"2000","journal-title":"J. Parallel Distribut. Comput."},{"issue":"7","key":"10.1016\/j.sysarc.2004.08.001_bib8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TC.1983.1676295","article-title":"Graph theoretical analysis and design of multistage interconnection networks","volume":"32","author":"Agrawal","year":"1983","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/j.sysarc.2004.08.001_bib9","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1109\/TC.1985.1676581","article-title":"On the rearrangeability of (2logN\u22121)-stage permutation networks","volume":"34","author":"Lee","year":"1985","journal-title":"IEEE Trans. Comput. C"},{"issue":"11","key":"10.1016\/j.sysarc.2004.08.001_bib10","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1109\/12.177307","article-title":"On a class of rearrangeable networks","volume":"41","author":"Yeh","year":"1992","journal-title":"IEEE Trans. Comput."},{"issue":"7","key":"10.1016\/j.sysarc.2004.08.001_bib11","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1109\/71.780867","article-title":"Work-efficient routing algorithms for rearrangeable symmetric networks","volume":"10","author":"Cam","year":"1999","journal-title":"IEEE Trans. Parallel Distribut. Syst."},{"issue":"11","key":"10.1016\/j.sysarc.2004.08.001_bib12","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/12.324560","article-title":"A new routing algorithm for a class of rearrangeable networks","volume":"43","author":"Feng","year":"1994","journal-title":"IEEE Trans. Comput."},{"issue":"8","key":"10.1016\/j.sysarc.2004.08.001_bib13","doi-asserted-by":"crossref","first-page":"694","DOI":"10.1109\/TC.1980.1675651","article-title":"On a class of multistage interconnection networks","volume":"29","author":"Wu","year":"1980","journal-title":"IEEE Trans. Comput. C"},{"issue":"8","key":"10.1016\/j.sysarc.2004.08.001_bib14","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1109\/C-M.1981.220290","article-title":"A survey of interconnection networks","volume":"14","author":"Feng","year":"1981","journal-title":"IEEE Comput. Mag."},{"issue":"9","key":"10.1016\/j.sysarc.2004.08.001_bib15","first-page":"1044","article-title":"An optimal O(NlgN) algorithm for permutation admissibility to extra-stage cube-type networks","volume":"44","author":"Shen","year":"1995","journal-title":"IEEE Trans. Comput."},{"issue":"5","key":"10.1016\/j.sysarc.2004.08.001_bib16","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1002\/j.1538-7305.1971.tb02569.x","article-title":"On a class of rearrangeable switching networks\u2014part I: control algorithm","volume":"50","author":"Opferman","year":"1971","journal-title":"Bell Syst. Techn. J."},{"issue":"4","key":"10.1016\/j.sysarc.2004.08.001_bib17","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1109\/TC.1986.1676763","article-title":"Fault-tolerant multiprocessors with redundant-path interconnection networks","volume":"35","author":"Raghavendra","year":"1986","journal-title":"IEEE Trans. Comput. C"},{"issue":"10","key":"10.1016\/j.sysarc.2004.08.001_bib18","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1109\/26.7531","article-title":"Rearrangeability of multistage shuffle\/exchange networks","volume":"36","author":"Varma","year":"1988","journal-title":"IEEE Trans. Commun."}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762104001201?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762104001201?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,30]],"date-time":"2019-01-30T13:22:44Z","timestamp":1548854564000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762104001201"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["S1383762104001201"],"URL":"https:\/\/doi.org\/10.1016\/j.sysarc.2004.08.001","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}