{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T03:40:23Z","timestamp":1648957223634},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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":["Parallel Computing"],"published-print":{"date-parts":[[1994,1]]},"DOI":"10.1016\/0167-8191(94)90114-7","type":"journal-article","created":{"date-parts":[[2003,9,3]],"date-time":"2003-09-03T17:52:02Z","timestamp":1062611522000},"page":"93-99","source":"Crossref","is-referenced-by-count":1,"title":["Fast digit-reversal algorithms on a shared-memory machine"],"prefix":"10.1016","volume":"20","author":[{"given":"Jaime","family":"Seguel","sequence":"first","affiliation":[]},{"given":"Dorothy","family":"Bollman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-8191(94)90114-7_BIB1","first-page":"213","article-title":"Digit-index permutations","volume":"91","author":"Bollman","year":"1992","journal-title":"Cogressus numer."},{"key":"10.1016\/0167-8191(94)90114-7_BIB2","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/0743-7315(91)90039-C","article-title":"Optimal matrix transposition and bit reversal on hypercubes: All-to-all personalized communication","volume":"11","author":"Edelman","year":"1991","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/0167-8191(94)90114-7_BIB3","series-title":"Proc. Internat. Conf. on Acoustic, Speech and Signal Processing, IEEE","first-page":"1099","article-title":"Fast bit-reversal algorithms","author":"Elster","year":"1989"},{"key":"10.1016\/0167-8191(94)90114-7_BIB4","first-page":"1511","article-title":"A fast recursive bit-reversal algorithm","volume":"3","author":"Jeong","year":"1990","journal-title":"ICASSP 90"},{"key":"10.1016\/0167-8191(94)90114-7_BIB5","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1109\/12.29465","article-title":"Optimum broadcasting and personalized communication in hypercubes","volume":"38","author":"Johnsson","year":"1989","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0167-8191(94)90114-7_BIB6","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1137\/0609037","article-title":"Algorithms for matrix transposition on a Boolean n-cube configured ensemble architectures","volume":"9","author":"Johnsson","year":"1988","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/0167-8191(94)90114-7_BIB7","first-page":"244","article-title":"An efficient algorithm for bit-reversal","volume":"79","author":"Seguel","year":"1990","journal-title":"Congressus Numer."}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901147?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167819194901147?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T09:28:18Z","timestamp":1551086898000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167819194901147"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["0167819194901147"],"URL":"https:\/\/doi.org\/10.1016\/0167-8191(94)90114-7","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}