{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T07:01:25Z","timestamp":1649142085286},"reference-count":11,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1016\/s0020-0190(00)00170-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:59:10Z","timestamp":1027619950000},"page":"11-16","source":"Crossref","is-referenced-by-count":1,"title":["Fault-tolerant algorithm for Fast Fourier Transform on hypercubes"],"prefix":"10.1016","volume":"79","author":[{"given":"Yu-Wei","family":"Chen","sequence":"first","affiliation":[]},{"given":"Kuo-Liang","family":"Chung","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00170-8_BIB001","series-title":"The Fast Fourier Transform","author":"Brigham","year":"1974"},{"key":"10.1016\/S0020-0190(00)00170-8_BIB002","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0167-8191(88)90087-7","article-title":"Gray codes, Fast Fourier Transforms and hypercubes","volume":"6","author":"Chamberlain","year":"1988","journal-title":"Parallel Comput."},{"key":"10.1016\/S0020-0190(00)00170-8_BIB003","series-title":"Proc. ACM Symp. Theory of Comput.","first-page":"274","article-title":"Reconfiguring a hypercube in the presence of faults","author":"H\u00e5stad","year":"1987"},{"key":"10.1016\/S0020-0190(00)00170-8_BIB004","series-title":"High radix FFT on boolean cube networks","author":"Johnsson","year":"1989"},{"key":"10.1016\/S0020-0190(00)00170-8_BIB005","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1016\/0898-1221(87)90085-X","article-title":"Fault diameter of interconnection networks","volume":"13","author":"Krishnamoorthy","year":"1987","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0020-0190(00)00170-8_BIB006","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1016\/S0020-0190(00)00170-8_BIB007","series-title":"Proc. 1993 International Conference on Parallel Processing","first-page":"280","article-title":"Prefix computation on a faulty hypercube","author":"Raghavendra","year":"1993"},{"issue":"9","key":"10.1016\/S0020-0190(00)00170-8_BIB008","doi-asserted-by":"crossref","first-page":"1152","DOI":"10.1109\/12.464395","article-title":"Free dimensions\u2014An effective approach to achieving fault tolerance in hypercubes","volume":"44","author":"Raghavendra","year":"1995","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(00)00170-8_BIB009","doi-asserted-by":"crossref","first-page":"867","DOI":"10.1109\/12.2234","article-title":"Topological properties of hypercube","volume":"37","author":"Saad","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(00)00170-8_BIB010","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-7315(92)90032-I","article-title":"Fault-tolerant sorting algorithm on hypercube multicomputers","volume":"16","author":"Sheu","year":"1992","journal-title":"J. Parallel Distributed Comput."},{"key":"10.1016\/S0020-0190(00)00170-8_BIB011","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0167-8191(87)90018-4","article-title":"Multiprocessor FFT's","volume":"5","author":"Swartztrauber","year":"1987","journal-title":"Parallel Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001708?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000001708?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T14:23:00Z","timestamp":1555683780000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000001708"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0020019000001708"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00170-8","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2001,5]]}}}