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
Queueing analysis of oblivious packet-routing networks
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Bounding delays in packet-routing networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Constant time per edge is optimal on rooted tree networks
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Dynamic deflection routing on arrays (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Nonmonotonic phenomena in packet routing
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Locally efficient on-line strategies for routing packets along fixed paths
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Journal of the ACM (JACM)
Universal-stability results and performance bounds for greedy contention-resolution protocols
Journal of the ACM (JACM)
A general approach to dynamic packet routing with bounded buffers
Journal of the ACM (JACM)
Wait-Free Deflection Routing of Long Messages
IEEE Transactions on Parallel and Distributed Systems
Design and Analysis of Dynamic Processes: A Stocastic Approach
ESA '98 Proceedings of the 6th Annual European Symposium on Algorithms
COMPUTING CALL ADMISSION CAPACITIES IN LINEAR NETWORKS
Probability in the Engineering and Informational Sciences
Constant time per edge is optimal on rooted tree networks
Distributed Computing
| Hi-index | 0.00 |