Routing, merging, and sorting on parallel models of computation
Journal of Computer and System Sciences
The connection machine
Optimal routing algorithms for mesh-connected processor arrays (extended abstract)
VLSI Algorithms and Architectures
A 2n-2 step algorithm for routing in an nxn array with constant size queues
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Bounds on evacuation time for deflection routing
Distributed Computing
Minimal adaptive routing on the mesh with bounded queue size
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Potential function analysis of greedy hot-potato routing
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Scheduling time-constrained communication in linear networks
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Randomized greedy hot-potato routing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Õ(congestion + dilation) hot-potato routing on leveled networks
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Hot-Potato Algorithms for Permutation Routing
IEEE Transactions on Parallel and Distributed Systems
Deterministic Many-to-Many Hot Potato Routing
IEEE Transactions on Parallel and Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Networks on which hot-potato routing does not livelock
Distributed Computing
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
A new bound for pure greedy hot potato routing
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Efficient bufferless routing on leveled networks
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Potential Function Analysis of Greedy Hot-Potato Routing
Theory of Computing Systems
| Hi-index | 0.00 |