Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the computational equivalence of hypercube-derived networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
A separator theorem for graphs with an excluded minor and its applications
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Coding theory, hypercube embeddings, and fault tolerance
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A unified geometric approach to graph separators
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Faster algorithms for finding small edge cuts in planar graphs
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Excluded minors, network decomposition, and multicommodity flow
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Area-Efficient VLSI Computation
Area-Efficient VLSI Computation
Shallow excluded minors and improved graph decompositions
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
Theory of Computing Systems
Hi-index | 0.00 |