{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T10:53:13Z","timestamp":1660301593474},"reference-count":14,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2000,4,1]],"date-time":"2000-04-01T00:00:00Z","timestamp":954547200000},"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":[[2000,4]]},"DOI":"10.1016\/s1383-7621(99)00022-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T18:33:56Z","timestamp":1049740436000},"page":"529-542","source":"Crossref","is-referenced-by-count":10,"title":["O(n) routing in rearrangeable networks"],"prefix":"10.1016","volume":"46","author":[{"given":"Nabanita","family":"Das","sequence":"first","affiliation":[]},{"given":"Krishnendu","family":"Mukhopadhyaya","sequence":"additional","affiliation":[]},{"given":"Jayasree","family":"Dattagupta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1383-7621(99)00022-3_BIB1","doi-asserted-by":"crossref","unstructured":"T.H. Szymanski, Design principle for practical self-routing nonblocking switching networks with O (NlogN) bit complexity, IEEE Trans. Comput. (1997) 1057\u20131069","DOI":"10.1109\/12.628391"},{"issue":"1","key":"10.1016\/S1383-7621(99)00022-3_BIB2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/321439.321449","article-title":"A permutation network","volume":"15","author":"Waksman","year":"1968","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"10.1016\/S1383-7621(99)00022-3_BIB3","doi-asserted-by":"crossref","first-page":"1601","DOI":"10.1002\/j.1538-7305.1971.tb02570.x","article-title":"On a class of rearrangeable switching networks-Part I: Control algorithm","volume":"50","author":"Opferman","year":"1971","journal-title":"Bell. Syst. Tech. J."},{"key":"10.1016\/S1383-7621(99)00022-3_BIB4","doi-asserted-by":"crossref","unstructured":"K.Y. Lee, A new benes network control algorithm, IEEE Trans. Comput. (1987) 768\u2013772","DOI":"10.1109\/TC.1987.1676970"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB5","doi-asserted-by":"crossref","unstructured":"Y.M. Yeh, T. Feng, On a class of rearrangeable networks, IEEE Trans. Comput. (1992) 1361\u20131379","DOI":"10.1109\/12.177307"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB6","doi-asserted-by":"crossref","unstructured":"Q. Hu, X. Shen, J. Yang, Topologies of combined 2logN\u22121)-stage interconnection networks, IEEE Trans. Comput. (1997) 118\u2013124","DOI":"10.1109\/12.559812"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB7","doi-asserted-by":"crossref","unstructured":"D. Nassimi, S. Sahni, Parallel algorithm to set up the Benes permutation network, IEEE Trans. Comput. (1982) 148\u2013154","DOI":"10.1109\/TC.1982.1675960"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB8","doi-asserted-by":"crossref","unstructured":"T.Y. Feng, S.W. Seo, A new routing algorithm for a class of rearrangeable networks, IEEE Trans. Comput. (1994) 1270\u20131280","DOI":"10.1109\/12.324560"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB9","doi-asserted-by":"crossref","unstructured":"J. Lenfant, Parallel permutations of data: A Benes network control algorithm for frequently used permutations, IEEE Trans. Comput. (1978) 637\u2013647","DOI":"10.1109\/TC.1978.1675164"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB10","doi-asserted-by":"crossref","unstructured":"D. Nassimi, S. Sahni, A self-routing Benes network and parallel permutation algorithms, IEEE Trans.Comput. (1981) 332\u2013340","DOI":"10.1109\/TC.1981.1675791"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB11","unstructured":"R. Boppana, C.S. Raghavendra, On self-routing in Benes and shuffle exchange networks, in: Proceedings of the International Conference on Parallel Processing, 1988, pp. 196\u2013200"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB12","unstructured":"D. Nassimi, A fault-tolerant routing algorithm for BPC permutations on multistage interconnection networks, in: Proceedings of the 1989 International Conference on Parallel Processing, 1989, pp. I278\u2013I287"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB13","doi-asserted-by":"crossref","unstructured":"N. Das, B.B. Bhattacharya, J. Dattagupta, Analysis of conflict graphs in multistage interconnection networks, IEEE Trans. Comput. (1993) 665\u2013677","DOI":"10.1109\/12.277286"},{"key":"10.1016\/S1383-7621(99)00022-3_BIB14","doi-asserted-by":"crossref","unstructured":"N. Das, B.B. Bhattacharya, J. Dattagupta, \u201cHierarchical classification of permutation classes in multistage interconnection networks, IEEE Trans. Comput. (1994) 1439\u20131444","DOI":"10.1109\/12.338106"}],"container-title":["Journal of Systems Architecture"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762199000223?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1383762199000223?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T00:06:20Z","timestamp":1580861180000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1383762199000223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,4]]},"references-count":14,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,4]]}},"alternative-id":["S1383762199000223"],"URL":"https:\/\/doi.org\/10.1016\/s1383-7621(99)00022-3","relation":{},"ISSN":["1383-7621"],"issn-type":[{"value":"1383-7621","type":"print"}],"subject":[],"published":{"date-parts":[[2000,4]]}}}