Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Communication effect basic linear algebra computations on hypercube architectures
Journal of Parallel and Distributed 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
Developments in concurrency and communication
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Improved Compressions of Cube-Connected Cycles Networks
IEEE Transactions on Parallel and Distributed Systems
Randomized load distribution of arbitrary trees in distributed networks
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
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
Efficient dynamic embeddings of binary trees into hypercubes
Journal of Algorithms
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
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.01 |