How Robust Is the n-Cube? (Extended Abstract)

No abstract is available for this paper.

• Publication year

  1986

• Venue

  IEEE Annual Symposium on Foundations of Computer Science

• Publication date

  1986-10-27

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/SFCS.1986.24
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A new look at fault tolerant network routing

  1984cited by this paper
• The cube-connected-cycles: A versatile network for parallel computation

  1979cited by this paper
• A Model of SIMD Machines and a Comparison of Various Interconnection Networks

  1979cited by this paper
• Microfiche supplement to “Every planar map is four colorable”

  1977cited by this paper
• The Indirect Binary n-Cube Microprocessor Array

  1977cited by this paper
• Every planar map is four colorable. Part I: Discharging

  1977cited by this paper
• Families of k-independent sets

  1973influential reference
• A Generalization of Results of P. Erdös, G. Katona, and D. J. Kleitman concerning Sperner's Theorem

  1971cited by this paper
• A DECOMPOSITION THEOREM FOR PARTIALLY ORDERED SETS

  1950cited by this paper
• Ein Satz über Untermengen einer endlichen Menge

  1928cited by this paper

• Fault tolerance in k-ary n-cube networks

  2012cites this paper
• Routing of 2-D switching networks by their embedding into cubes

  2000cites this paper
• Fault-Tolerant Characteristics and Topological Properties of a Hierarchical Network of Hypercubes

  1999cites this paper
• Dynamic processor allocation in scalable multiprocessors using boolean algebra

  1998cites this paper
• Fault-tolerant message routing in the extended hypercube

  1998cites this paper
• Efficient Determination of Maximum Incomplete Subcubes in Hypercubes with Faults

  1996cites this paper
• Reconfiguration and experiments on a faulty hypercube

  1995cites this paper
• A Fault-Tolerant Distributed Subcube Management Scheme for Hypercube Multicomputer Systems

  1995cites this paper
• Finding nonfaulty subtrees in faulty binary tree architectures

  1994cites this paper
• Modular fault-tolerant Boolean n-cubes

  1994cites this paper
• Deadlock-Free Fault-Tolerant Routing in Injured Hypercubes

  1993cites this paper
• Linear Layouts of Generalized Hypercubes

  1993cites this paper
• Hyperbanyan networks: a new class of networks for distributed-memory multiprocessors

  1992cites this paper
• Robust bounded-degree networks with small diameters

  1992cites this paper
• Processor Allocation for Hypercubes

  1992cites this paper
• Design and analysis of software reconfiguration strategies for hypercube multicomputers under multiple faults

  1992cites this paper
• Coding theory, hypercube embeddings, and fault tolerance

  1991cites this paper
• ATARIC: an algebraic technique to analyse reconfiguration for fault tolerance in a hypercube

  1991cites this paper
• Subtree Availability in Binary Tree Architectures

  1991cites this paper
• Distributed Subcube Identification Algorithms for Reliable Hypercupes

  1991cites this paper
• Running algorithms efficiently on faulty hypercubes (extended abstract)

  1991influential citation
• Spare Allocation and Reconfiguration in a Fault Tolerant Hypercube with Direct Connect Capability

  1991cites this paper
• Two-terminal reliability of hypercubes

  1991cites this paper
• Graceful Degradation on Hypercube Multiprocessors Using Data Redistribution

  1990cites this paper
• Resource Allocation in Hypercube Systems

  1990cites this paper
• Fault-tolerant hypercube multiprocessors

  1990cites this paper
• An optimal fault-tolerant broadcasting algorithm for a hypercube multiprocessor

  1990cites this paper
• Mapping Pyramid Algorithms into Hypercubes

  1990cites this paper
• Largest induced subgraphs of the n-cube that contain no 4-cycles

  1989cites this paper
• ADAPTIVE FAULT-TOLERANT ROUTING

  1989cites this paper
• On processor allocation in hypercube multiprocessors

  1989cites this paper
• A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor

  1988cites this paper
• Distributing resources in hypercube computers

  1988cites this paper
• Comparing Interconnection Networks

  1988cites this paper
• An efficient multi-dimensional grids reconfiguration algorithm on hypercube

  1988cites this paper
• Processor Allocation in an N-Cube Multiprocessor Using Gray Codes

  1987cites this paper
• Reconfiguring a hypercube in the presence of faults

  1987cites this paper