Average case analysis of greedy routing algorithms on arrays
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Message-passing algorithms for a SIMD torus with coteries
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Disjoint paths through a 3-dimensional grid
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Randomized sorting and selection on mesh-connected processor arrays (preliminary version)
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Balanced routing: towards the distance bound on grids
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Methods for message routing in parallel machines
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Optimal sorting on mesh-connected processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Implementations of randomized sorting on large parallel machines
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for routing and sorting on multi-dimensional meshes
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Minimal adaptive routing on the mesh with bounded queue size
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Basic Operations on the OTIS-Mesh Optoelectronic Computer
IEEE Transactions on Parallel and Distributed Systems
Many-to-one packet routing on the mesh
CSC '91 Proceedings of the 19th annual conference on Computer Science
A (2.954 + ε)n oblivious routing algorithm on 2D meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
An Efficient Heuristic for Permutation Packet Routing on Meshes with Low Buffer Requirements
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |