Optimal simulations by Butterfly Networks
STOC '88 Proceedings of the twentieth 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
Work-preserving emulations of fixed-connection networks
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Coding theory, hypercube embeddings, and fault tolerance
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
Branch-and-bound and backtrack search on mesh-connected arrays of processors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Maintaining dynamic ordered sets on processor networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Space-efficient scheduling of multithreaded computations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Taking random walks to grow trees in hypercubes
Journal of the ACM (JACM)
Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract)
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
Optimal Simulation of Full Binary Trees on Faulty Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Task Clustering and Scheduling for Distributed Memory Parallel Architectures
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |