Efficient Dynamic Embedding of Arbitrary Binary Trees into Hypercubes

Embedding graphs with bounded treewidth into their optimal hypercubes

Journal of Algorithms

Performance Evaluation of a Random-Walk-Based Algorithm for Embedding Dynamically Evolving Trees in Butterflies

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium

Asynchronous Random Polling Dynamic Load Balancing

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation

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

Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks

Journal of Parallel and Distributed Computing