{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:25:20Z","timestamp":1757629520917,"version":"3.44.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1992,9,1]],"date-time":"1992-09-01T00:00:00Z","timestamp":715305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1992,9]]},"DOI":"10.1016\/0743-7315(92)90039-p","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":11,"title":["Generalized shuffle permutations on boolean cubes"],"prefix":"10.1016","volume":"16","author":[{"given":"S.Lennart","family":"Johnsson","sequence":"first","affiliation":[]},{"given":"Ching-Tien","family":"Ho","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"9","key":"10.1016\/0743-7315(92)90039-P_BIB1","doi-asserted-by":"crossref","first-page":"809","DOI":"10.1109\/TC.1982.1676096","article-title":"A unified approach to a class of data movements on an array processor","volume":"31","author":"Flanders","year":"1982","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90039-P_BIB2","series-title":"The Third Conference on Hypercube Concurrent Computers and Applications","first-page":"725","article-title":"Optimal algorithms for stable dimension permutations on Boolean cubes","author":"Ho","year":"1988"},{"issue":"2","key":"10.1016\/0743-7315(92)90039-P_BIB3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","article-title":"Communication efficient basic linear algebra computations on hypercube architectures","volume":"4","author":"Johnsson","year":"1987","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10.1016\/0743-7315(92)90039-P_BIB4","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0609037","article-title":"Matrix transposition on Boolean n-cube configured ensemble architectures","volume":"9","author":"Johnsson","year":"1988","journal-title":"SIAM J. Matrix Anal. Appl."},{"article-title":"Shuffle permutations on Boolean cubes","year":"1988","author":"Johnsson","key":"10.1016\/0743-7315(92)90039-P_BIB5"},{"issue":"9","key":"10.1016\/0743-7315(92)90039-P_BIB6","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Spanning graphs for optimum broadcasting and personalized communications in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0743-7315(92)90039-P_BIB7","series-title":"The Fifth Distributed Memory Computing Conference","first-page":"370","article-title":"The complexity of reshaping arrays on Boolean cubes","author":"Johnsson","year":"1990"},{"key":"10.1016\/0743-7315(92)90039-P_BIB8","series-title":"The Sixth Distributed Memory Computing Conference","first-page":"299","article-title":"Maximizing channel utilization for all-to-all personalized communication on Boolean cubes","author":"Johnsson","year":"1991"},{"article-title":"Optimal communication channel utilization for matrix transposition and related permutations on Boolean cubes","year":"1991","author":"Johnsson","key":"10.1016\/0743-7315(92)90039-P_BIB9"},{"issue":"1","key":"10.1016\/0743-7315(92)90039-P_BIB10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1145\/322169.322172","article-title":"An optimal routing algorithm for meshconnected parallel computers","volume":"27","author":"Nassimi","year":"1980","journal-title":"J. Assoc. Comput. Math."},{"issue":"4","key":"10.1016\/0743-7315(92)90039-P_BIB11","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/TC.1982.1676004","article-title":"Optimal BPC permutations on a cube connected SIMD computer","volume":"C-31","author":"Nassimi","year":"1982","journal-title":"IEEE Trans. Comput."},{"article-title":"Topological properties of hypercubes","year":"1985","author":"Saad","key":"10.1016\/0743-7315(92)90039-P_BIB12"},{"article-title":"Intensive hypercube communication I: Prearranged communication in link-bound machines","year":"1987","author":"Stout","key":"10.1016\/0743-7315(92)90039-P_BIB13"},{"key":"10.1016\/0743-7315(92)90039-P_BIB14","series-title":"Hypercube Multiprocessors 1987","article-title":"Passing messages in link-bound hypercubes","author":"Stout","year":"1987"},{"key":"10.1016\/0743-7315(92)90039-P_BIB15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","article-title":"Multiprocessor FFTs","volume":"5","author":"Swarztrauber","year":"1987","journal-title":"Parallel Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290039P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159290039P?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:28:34Z","timestamp":1757514514000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159290039P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,9]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,9]]}},"alternative-id":["074373159290039P"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(92)90039-p","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1992,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Generalized shuffle permutations on boolean cubes","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(92)90039-P","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1992 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}