Efficient Schemes for Parallel Communication
Journal of the ACM (JACM)
Continuous routing and batch routing on the hypercube
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Randomized parallel communications on an extension of the omega network
Journal of the ACM (JACM)
Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Optimal communication algorithms for hypercubes
Journal of Parallel and Distributed Computing
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Randomized parallel communication (Preliminary Version)
PODC '82 Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple algorithms for routing on butterfly networks with bounded queues
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Asynchronous shared memory search structures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Universal continuous routing strategies
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
On the communication throughput of buffered multistage interconnection networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Constant time per edge is optimal on rooted tree networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The performance of simple routing algorithms that drop packets
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Data management in networks: experimental evaluation of a provably good strategy
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Greedy dynamic routing on arrays
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Homogeneous Routing for Homogeneous Traffic Patterns on Meshes
IEEE Transactions on Parallel and Distributed Systems
Journal of the ACM (JACM)
A general approach to dynamic packet routing with bounded buffers
Journal of the ACM (JACM)
Efficient Routing Schemes for Multiple Broadcasts in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A journey into multicomputer routing algorithms
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Analytically Modeling a Fault-Tolerant Messaging Protocol
IEEE Transactions on Computers
Constant time per edge is optimal on rooted tree networks
Distributed Computing
| Hi-index | 0.00 |