Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Universal graphs for bounded-degree trees and planar graphs
SIAM Journal on Discrete Mathematics
Fault tolerance in hypercube-derivative networks
SPAA '89 Proceedings of the first 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
Efficient embeddings of trees in hypercubes
SIAM Journal on Computing
Product-shuffle networks: toward reconciling shuffles and butterflies
Discrete Applied Mathematics - Special double volume: interconnection networks
Optimal emulations by butterfly-like networks
Journal of the ACM (JACM)
Issues in the Study of Graph Embeddings
WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
| Hi-index | 0.00 |