Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
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
On the computational equivalence of hypercube-derived networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A unified approach to off-line permutation routing on parallel networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Percolation theory and computing with faulty arrays of processors
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
The area-time complexity of sorting (algorithms, computation, architecture, vlsi)
The area-time complexity of sorting (algorithms, computation, architecture, vlsi)
Multi-scale self-simulation: a technique for reconfiguring arrays with faults
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Construction of the mesh and the torus tolerating a large number of faults
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Hi-index | 0.00 |