An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Lower bounds for sorting on mesh-connected architectures
Acta Informatica
VLSI Algorithms and Architectures
Tight bounds on the complexity of parallel sorting
IEEE Transactions on Computers
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
Deterministic sorting in nearly logarithmic time on the hypercube and related computers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
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
Concentrated regular data streams on grids: sorting and routing near to the bisection bound
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Constant queue routing on a mesh
Journal of Parallel and Distributed Computing
Simple path selection for optimal routing on processor arrays
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Matching the bisection bound for routing and sorting on the mesh
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
Block Gossiping on Grids and Tori: Deterministic Sorting and Routing Match the Bisection Bound
ESA '93 Proceedings of the First Annual European Symposium on Algorithms
Universal schemes for parallel communication
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Optimal Deterministic Routing and Sorting on Mesh-Connected Arrays ofProcessors
Optimal Deterministic Routing and Sorting on Mesh-Connected Arrays ofProcessors
Improved bounds for routing and sorting on multi-dimensional meshes
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Constructive deterministic PRAM simulation on a mesh-connected computer
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
IEEE Transactions on Computers
Practical parallel algorithms for personalized communication and integer sorting
Journal of Experimental Algorithmics (JEA)
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A (2.954 + ε)n oblivious routing algorithm on 2D meshes
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Solving Fundamental Problems on Sparse-Meshes
IEEE Transactions on Parallel and Distributed Systems
Hybrid Algorithms for Complete Exchange in 2D Meshes
IEEE Transactions on Parallel and Distributed Systems
Matrix Transpose on Meshes: Theory and Practice
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
List-ranking on interconnection networks
Information and Computation
Faster deterministic sorting through better sampling
Theoretical Computer Science
Multistage off-line permutation packet routing on a mesh: an approach with elementary mathematics
Journal of Computer Science and Technology
On the price of security in large-scale wireless ad hoc networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |