An optimal sorting algorithm for mesh connected computers
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
A randomized parallel branch-and-bound procedure
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Dynamic tree embeddings in butterflies and hypercubes
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Tight bounds for on-line tree embeddings
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Sorting on a mesh-connected parallel computer
Communications of the ACM
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Dynamic randomized simulation of hierarchical PRAMs on meshes
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
Asymptotically Optimal Randomized Tree Embedding in Static Networks
IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
On the performance of randomized embedding of reproduction trees in static networks
International Journal of Parallel Programming
Analysis of randomized load distribution for reproduction trees in linear arrays and rings
Theoretical Computer Science
Rapidly Mixing Random Walks on Hypercubes with Application to Dynamic Tree Evolution
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |