Simulation of large networks on smaller networks
Information and Control
Efficient simulations among several models of parallel computers
SIAM Journal on Computing
Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
An O(logN) deterministic packet routing scheme
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
A complexity theory of efficient parallel algorithms
Theoretical Computer Science - Special issue: Fifteenth international colloquium on automata, languages and programming, Tampere, Finland, July 1988
On the computational equivalence of hypercube-derived networks
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Efficient embeddings and simulations for hypercubic networks
Efficient embeddings and simulations for hypercubic networks
Theoretical aspects of VLSI pin limitations
SIAM Journal on Computing
Bandwidth-based lower bounds on slowdown for efficient emulations of fixed-connection networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Efficiency in parallel computation: algorithms, emulations, and VLSI pins
Efficiency in parallel computation: algorithms, emulations, and VLSI pins
Issues in the Study of Graph Embeddings
WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
A structural theory of recursively decomposable parallel processor-networks
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Bandwidth-based upper bounds on the scalability of micro-grained network machines
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Improved routing and sorting on multibutterflies
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the Bisection Width and Expansion of Butterfly Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Optimal Tradeoffs Between Size and Slowdown for Universal Parallel Networks
Theory of Computing Systems
| Hi-index | 0.00 |