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
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
A Simpler Analysis of the Karp-Zhang Parallel Branch-and-Bound Method
Parallel algorithms for combinatorial search problems
Parallel algorithms for combinatorial search problems
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
Unstructured tree search on SIMD parallel computers: a summary of results
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
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)
Randomized parallel algorithms for backtrack search and branch-and-bound computation
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
Performance evaluation of probabilistic tree embedding in cube-connected cycles
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
Maintenance of tree structured computations on parallel and distributed computer systems
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
On dynamic tree growing in hypercubes
SAC '97 Proceedings of the 1997 ACM symposium on Applied computing
State of the Art in Parallel Search Techniques for Discrete Optimization Problems
IEEE Transactions on Knowledge and Data Engineering
Unstructured Tree Search on SIMD Parallel Computers
IEEE Transactions on Parallel and Distributed Systems
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Random Seeking: A General, Efficient, and Informed Randomized Scheme for Dynamic Load Balancing
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
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 |