Fault tolerance in hypercube-derivative networks

Fast computation using faulty hypercubes

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing

Running algorithms efficiently on faulty hypercubes

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures

An approach to emulating separable graphs (preliminary version)

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures

Running algorithms efficiently on faulty hypercubes (extended abstract)

ACM SIGARCH Computer Architecture News - Symposium on parallel algorithms and architectures

Robust bounded-degree networks with small diameters

SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures

Tolerating Faults in Hypercubes Using Subcube Partitioning

IEEE Transactions on Computers - Special issue on fault-tolerant computing

Fault-tolerant meshes with small degree

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures

Fault-Tolerant Ring Embedding in de Bruijn Networks

IEEE Transactions on Computers

Optimal Simulation of Full Binary Trees on Faulty Hypercubes

IEEE Transactions on Parallel and Distributed Systems

Optimal emulations by butterfly-like networks

Journal of the ACM (JACM)

Distributed Ring Embedding in Faulty De Bruijn Networks

IEEE Transactions on Computers

Fault-Tolerant Meshes and Hypercubes with Minimal Numbers of Spares

IEEE Transactions on Computers

Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes

IEEE Transactions on Computers