{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:47:37Z","timestamp":1742381257511},"reference-count":21,"publisher":"Elsevier BV","issue":"7","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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":["Microprocessing and Microprogramming"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0165-6074(95)00017-i","type":"journal-article","created":{"date-parts":[[2003,10,24]],"date-time":"2003-10-24T01:50:20Z","timestamp":1066960220000},"page":"449-468","source":"Crossref","is-referenced-by-count":3,"title":["Bit-permute multistage interconnection networks"],"prefix":"10.1016","volume":"41","author":[{"given":"Myung-Kyun","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunsoo","family":"Yoon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.R.","family":"Maeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0165-6074(95)00017-I_BIB1","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1109\/TC.1983.1676295","article-title":"Graph theoretical analysis and design of multistage interconnection networks","author":"Agrawal","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0165-6074(95)00017-I_BIB2","series-title":"Proc. of Int. Conf. on Parallel Processing","first-page":"65","article-title":"The flip network in STARAN","author":"Batcher","year":"1976"},{"issue":"5","key":"10.1016\/0165-6074(95)00017-I_BIB3","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":"Bell Syst. Tech. J."},{"key":"10.1016\/0165-6074(95)00017-I_BIB4","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","article-title":"A study of nonblocking switching networks","volume":"32","author":"Clos","year":"1953","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0165-6074(95)00017-I_BIB5","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1109\/T-C.1974.223927","article-title":"Data manipulating functions in parallel processors and implementations","author":"Feng","year":"1974","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB6","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/12.324560","article-title":"A new routing algorithm for a class of rearrangeable networks","author":"Feng","year":"1994","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB7","series-title":"Proc. First Annual Computer Architecture Conf.","first-page":"21","article-title":"Banyan networks for partitioning multiprocessing systems","author":"Goke","year":"1973"},{"key":"10.1016\/0165-6074(95)00017-I_BIB8","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1109\/TC.1986.1676800","article-title":"Finite state model and compatibility theory: New analysis tools for permutation networks","author":"Huang","year":"1986","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB9","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.1109\/T-C.1975.224157","article-title":"Access and alignment of data in an array processor","author":"Lawrie","year":"1975","journal-title":"IEEE Trans. on Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB10","first-page":"412","article-title":"On the rearrangeability of 2(log2 N)-1 stage permutation networks","author":"Lee","year":"1985","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB11","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TC.1981.6312171","article-title":"A fast parallel algorithm for routing in permutation networks","volume":"C-30","author":"Lev","year":"1981","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB12","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1145\/322169.322172","article-title":"An optimal routing algorithm for mesh-connected parallel computers","volume":"27","author":"Nassimi","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0165-6074(95)00017-I_BIB13","series-title":"Proc. Conf. on Parallel Processing","first-page":"I-278","article-title":"A fault-tolerant routing algorithm for BPC permutations on multistage interconnection networks","author":"Nassimi","year":"1989"},{"issue":"5","key":"10.1016\/0165-6074(95)00017-I_BIB14","doi-asserted-by":"crossref","first-page":"1579","DOI":"10.1002\/j.1538-7305.1971.tb02569.x","article-title":"On a class of rearrangeable switching network Part I: Control algorithm","volume":"50","author":"Opferman","year":"1971","journal-title":"Bell Syst. Tech. J."},{"key":"10.1016\/0165-6074(95)00017-I_BIB15","author":"Varma","year":"1994"},{"key":"10.1016\/0165-6074(95)00017-I_BIB16","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. ACM"},{"key":"10.1016\/0165-6074(95)00017-I_BIB17","first-page":"694","article-title":"On a class of multistage interconnection networks","author":"Wu","year":"1980","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB18","first-page":"801","article-title":"The reverse-exchange interconnection network","author":"Wu","year":"1980","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB19","first-page":"1361","article-title":"On a class of rearrangeable networks","author":"Yeh","year":"1992","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB20","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1109\/12.53604","article-title":"Equivalence between functionality and topology of log N-stage banyan networks","author":"Youssef","year":"1990","journal-title":"IEEE Trans. Computers"},{"key":"10.1016\/0165-6074(95)00017-I_BIB21","first-page":"235","article-title":"Functional and topological relations among banyan multistage networks of differing switch sizes","author":"Youssef","year":"1993","journal-title":"IEEE Trans. Computers"}],"container-title":["Microprocessing and Microprogramming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749500017I?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016560749500017I?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T03:28:35Z","timestamp":1550546915000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016560749500017I"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":21,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["016560749500017I"],"URL":"https:\/\/doi.org\/10.1016\/0165-6074(95)00017-i","relation":{},"ISSN":["0165-6074"],"issn-type":[{"value":"0165-6074","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}