1. Coding theory, hypercube embeddings and fault tolerance;Aiello,1991
2. Take a walk, grow a tree;Bhatt,1988
3. Taking random walks to grow trees in hypercubes;Bhatt;J. ACM,1993
4. Tight bounds for on-line tree embeddings;Bhatt,1991
5. C.-P. Cao, Simulation and Performance Evaluation of Dynamic Tree Embedding on Meshes, M.S. Thesis, Department of Mathematics and Computer Science, State University of New York, New Paltz, New York, May 1997.