J. Hastad and T. Leighton and M. Newmann, \Recon guring a Hypercube in the Presence of Faults", Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, 274 - 284. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Distributed Computing On Anonymous Hypercubes With Faulty.. - Kranakis, Santoro (1992) (Correct)
....above assumptions see [2] Routing algorithms on hypercubes have been studied in [6] Faulty hypercube networks have been examined in several papers under the much stronger assumption of synchronous and or non identical processors. In such networks it is possible to apply recon guring techniques [7] (nodes of an n 1 dimensional hypercube are mapped into non faulty nodes of an n dimensional hypercube with O(1) dilation) or even non faulty subcube techniques [5] for a given k determine an n k dimensional subcube with no faulty links) However such techniques are not applicable in our case ....
J. Hastad and T. Leighton and M. Newmann, \Recon guring a Hypercube in the Presence of Faults", Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, 274 - 284.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC