{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:23Z","timestamp":1725664343595},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584261"},{"type":"electronic","value":"9783540487852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58426-9_156","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:00:50Z","timestamp":1330272050000},"page":"529-545","source":"Crossref","is-referenced-by-count":2,"title":["Reconfiguration of faulty hypercubes"],"prefix":"10.1007","author":[{"given":"Dimiter R.","family":"Avresky","sequence":"first","affiliation":[]},{"given":"Khalid M.","family":"Al-Tawil","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"36_CR1","unstructured":"K. Altawil, D. Avresky, and D. Pradhan, \u201cFault Tolerance of Hypercubes Using Spanning Trees,\u201d Technical Report 93-055, Department of Computer Science, Texas A & M University, Dec. 93."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"K.M. Altawil and D.R. Avresky, \u201cReconfiguration of Spanning Trees in Faulty Hypercubes,\u201d Proc. 23rd Int'l Con. on Par. Proc., Chicago, Illinois, USA, Aug. 1994.","DOI":"10.1109\/ICPP.1994.173"},{"key":"36_CR3","unstructured":"D.R. Avresky et al., \u201cAn Approach to Fault Diagnosis in Multimicrocomputer Systems: Algorithm and Simulation,\u201d Proc. 17th Int'l Symp. on Fault Tolerant Computing, pp. 305\u2013310, June 1987."},{"key":"36_CR4","unstructured":"S.G. Aki, The Design and Analysis of Parallel Algorithms. Prentice-Hall International, Inc., 1989."},{"issue":"No.7","key":"36_CR5","doi-asserted-by":"publisher","first-page":"842","DOI":"10.1109\/12.256452","volume":"C-41","author":"A. Bagchi","year":"1992","unstructured":"A. Bagchi and S. Hakimi, \u201cData Transfers in Broadcast Networks,\u201d IEEE Trans. on Comp., Vol. C-41, No. 7, July 1992, pp. 842\u2013847.","journal-title":"IEEE Trans. on Comp."},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"P. Banerjee, \u201cStrategies for Reconfiguring Hypercubes Under Faults,\u201d Proc. 20th Int'l Symp. on Fault Tolerant Computing. pp. 210\u2013217, June 1990.","DOI":"10.1109\/FTCS.1990.89368"},{"issue":"No.1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0196-6774(80)90004-8","volume":"1","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley, \u201cA Parallel Algorithm for Constructing Minimum Spanning Trees,\u201d J. of Algorithms, Vol. 1, No. 1, pp. 51\u201359, March 1980.","journal-title":"J. of Algorithms"},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0020-0190(90)90160-Y","volume":"34","author":"A. Bagchi","year":"1990","unstructured":"A. Bagchi, S. Hakimi, J. Mitchem, and E. Schmeichel, \u201cParallel Algorithms For Gossiping by Mail,\u201d Information Processing Letters, Vol. 34, pp. 197\u2013202, April 1990.","journal-title":"Information Processing Letters"},{"key":"36_CR9","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0743-7315(91)90033-6","volume":"11","author":"D. Bertsekas","year":"1991","unstructured":"D. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, \u201cOptimal Communication Algorithms for Hypercubes,\u201d J. of Par. and Dist. Computing, Vol 11, pp. 263\u2013275, 1991.","journal-title":"J. of Par. and Dist. Computing"},{"key":"36_CR10","unstructured":"T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. McGraw-Hill, pp. 498\u2013513, 1990."},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"M. Y. Chen and S. Lee, \u201cFault-Tolerant Embedding of Complete Binary Trees in Hypercubes,\u201d IEEE Tran. on Par. and Dist. Sys., Vol. 4, No. 3, March 1993.","DOI":"10.1109\/71.210811"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"S. Chau and A. Liestman, \u201cA Proposal for a Fault Tolerant Binary Hypercube Architecture,\u201d Proc. 19th Int'l Symp. on Fault Tolerant Computing, pp. 323\u2013330, June 1989.","DOI":"10.1109\/FTCS.1989.105587"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"S. Dutt and J. Hayes, \u201cAn Automorphic Approach to the design of Fault-Tolerant Multiprocessors,\u201d Proc. 19th Int'l Symp. on Fault Tolerant Computing, pp. 496\u2013503, June 1989.","DOI":"10.1109\/FTCS.1989.105625"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"Kemal Efe and Kumar Ramaiyer, \u201cCongestion and Fault Tolerance of Binary Tree Embeddings on Hypercube,\u201d Fifth Int'l. Par. Proc. Symp., 1991.","DOI":"10.1109\/IPPS.1991.153819"},{"key":"36_CR15","doi-asserted-by":"crossref","unstructured":"G. Frederickson, \u201cData Structures for On-Line Updating of Minimum Spanning Trees with Applications,\u201d SIAM J. Comput, Vol 14, No 4, Nov. 1985.","DOI":"10.1137\/0214055"},{"issue":"No.1","key":"36_CR16","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/357195.357200","volume":"5","author":"R. Gallager","year":"1983","unstructured":"R. Gallager, P. Humblet, and P. Spira, \u201cA Distributed Algorithm for Minimum Weight Spanning Trees,\u201d ACM Trans. on Prog. Languages and Systems. Vol. 5, No. 1, pp. 66\u201377, Jan. 1983.","journal-title":"ACM Trans. on Prog. Languages and Systems"},{"issue":"No.9","key":"36_CR17","first-page":"197","volume":"C-38","author":"S. Johnsson","year":"1989","unstructured":"S. Johnsson, and C. Ho, \u201cOptimum Broadcasting and Personalized Communication in Hypercubes,\u201d IEEE Trans. on Comp., Vol. C-38, No. 9, pp. 197\u2013202, Sept. 1989.","journal-title":"IEEE Trans. on Comp."},{"key":"36_CR18","unstructured":"S. Kwan and W Ruzzo. \u201cAdaptive Parallel Algorithms for Finding Minimum Spanning Trees,\u201d Proc, of the 1984 Int'l. Conf. on Parallel Processing, Bellaire, Michigan, pp. 439\u2013443, Aug. 1984."},{"key":"36_CR19","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1016\/0743-7315(92)90077-Z","volume":"14","author":"T. Lee","year":"1992","unstructured":"T. Lee and J. Hayes, \u201cDesign of Gracefully Degradable Hypercube-Connected Systems,\u201d J. of Parallel and Distributed Computing, Vol. 14, pp. 390\u2013401, 1992.","journal-title":"J. of Parallel and Distributed Computing"},{"key":"36_CR20","doi-asserted-by":"crossref","unstructured":"M. Peercy and P. Banerjee, \u201cDistributed Algorithms for Shortest-Path, Deadlock-Free Routing and Broadcasting in Arbitrarily Faulty Hypercubes,\u201d Proc. 20th Int'l Symp. on Fault Tolerant Computing, pp. 218\u2013225, June 1990.","DOI":"10.1109\/FTCS.1990.89369"},{"key":"36_CR21","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0020-0190(93)90044-A","volume":"45","author":"S. Ravindran","year":"1993","unstructured":"S. Ravindran and A. Gibbons, \u201cDense Edge-Disjoint Embedding of Complete Binary Trees in the Hypercube,\u201d Information Processing Letters. Vol. 45, pp. 321\u2013325, April 1993.","journal-title":"Information Processing Letters"},{"key":"36_CR22","unstructured":"D. Rennets, \u201cOn Implementing Fault Tolerance in Binary Hypercubes,\u201d Proc. 16th Int'l Symp. on Fault Tolerant Computing, pp. 344\u2013349, June 1986."},{"key":"36_CR23","unstructured":"K. Ravindran, G. Sing, and P. Gupta, \u201cReconfiguration of Spanning Trees in Networks in the Presence of Node Failures,\u201d The 13th Int'l. Conf. on Distr. Comp. Sys., pp. 219\u2013226. May 1993."},{"key":"36_CR24","doi-asserted-by":"crossref","unstructured":"C. Raghavendra, P. Yang, and S. Tien, \u201cFree Dimensions \u2014 An Effective Approach to Achieving Fault Tolerance in Hypercubes,\u201d Proc. 22nd Int'l Symp. on Fault Tolerant Computing, pp. 170\u2013177, July 1992.","DOI":"10.1109\/FTCS.1992.243603"},{"issue":"No.7","key":"36_CR25","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1109\/12.2234","volume":"C-37","author":"Y. Saad","year":"1988","unstructured":"Y. Saad and M. Schultz, \u201cTopological Properties of Hypercubes,\u201d IEEE Tran. on Comp., Vol. C-37, No. 7, July 1988. pp. 867\u2013872.","journal-title":"IEEE Tran. on Comp."},{"key":"36_CR26","doi-asserted-by":"crossref","unstructured":"A. Sen, A. Sengupta, and S. Bandyopadhyay, \u201cOn Some Topological Properties of Hypercube, Incomplete Hypercube and Supercube,\u201d Seventh Int'l. Par. Proc. Symp., 1993.","DOI":"10.1109\/IPPS.1993.262806"},{"key":"36_CR27","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(93)90099-U","volume":"46","author":"G. Stamoulis","year":"1993","unstructured":"G. Stamoulis and J. Tsitsiklis, \u201cAn Efficient Algorithm for Multiple Simultaneous Broadcasts in the Hypercube,\u201d Information Processing Letters, Vol. 46, pp. 219\u2013224. July 1993.","journal-title":"Information Processing Letters"},{"issue":"No.7","key":"36_CR28","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1109\/71.238297","volume":"4","author":"G. Stamoulis","year":"1993","unstructured":"G. Stamoulis and J. Tsitsiklis, \u201cEfficient Routing Schemes for Multiple Broadcasts in Hypercubes,\u201d IEEE Trans. on Par. and Dist. Sys., Vol. 4, No. 7, pp. 725\u2013739, July 1993.","journal-title":"IEEE Trans. on Par. and Dist. Sys."},{"key":"36_CR29","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1006\/jpdc.1993.1042","volume":"18","author":"A. Wagner","year":"1993","unstructured":"A. Wagner, \u201cEmbedding All Binary Trees in the Hypercube,\u201d J. of Par. and Dist. Computing, Vol. 18, pp. 33\u201343, 1993.","journal-title":"J. of Par. and Dist. Computing"},{"key":"36_CR30","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0020-0190(93)90116-Q","volume":"45","author":"F. Wang","year":"1993","unstructured":"F. Wang and F. Lin, \u201cOn Constructing Multiple Spanning Trees in a Hypercube,\u201d Information Processing Letters, Vol. 45, pp. 177\u2013183, March 1993.","journal-title":"Information Processing Letters"},{"key":"36_CR31","unstructured":"W.W. White, \u201cMapping General Trees and Graphs into the Hypercube,\u201d Proc. of the ISCA Int'l. Conf., Parallel and Distributed Computing, pp. 157\u2013161, October 14\u201316. 1993."},{"key":"36_CR32","doi-asserted-by":"crossref","unstructured":"P. Yang and C. Raghavendra, \u201cEmbedding and Reconfiguration of Binary Trees in Faulty Hypercubes,\u201d Sixth Int'l. Par. Proc. Symp., pp. 2\u20139, 1992.","DOI":"10.1109\/IPPS.1992.223080"},{"key":"36_CR33","doi-asserted-by":"crossref","unstructured":"P. Yang and C. Raghavendra, \u201cReconfiguration of Binary Trees in Faulty Hypercubes,\u201d Seventh Int'l. Par. Proc. Symp., pp. 401\u2013405, 1993.","DOI":"10.1109\/IPPS.1993.262916"}],"container-title":["Lecture Notes in Computer Science","Dependable Computing \u2014 EDCC-1"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58426-9_156.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:20:31Z","timestamp":1605648031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58426-9_156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584261","9783540487852"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-58426-9_156","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}
