Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Bounds on the greedy routing algorithm for array networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Greedy dynamic routing on arrays
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
On the analysis of randomized load balancing schemes
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
How useful is old information (extended abstract)?
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Analyses of load stealing models based on differential equations
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
How Useful Is Old Information?
IEEE Transactions on Parallel and Distributed Systems
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |