1. W. Aiello, T. Leighton, Coding theory, hypercube embeddings, and fault tolerance, Proc. 3rd ACM Symp. on Parallel Algorithms and Architectures, Hilton Head, South Carolina, July 1991, pp. 125–136.
2. Taking random walks to grow trees in hypercubes;Bhatt;J. ACM,1993
3. S. Bhatt, D. Greenberg, T. Leighton, P. Liu, Tight bounds for on-line tree embeddings, Proc. 2nd ACM-SIAM Symp. on Discrete Algorithms, San Francisco, California, 1991, pp. 344–350.
4. 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.
5. Asymptotic hypercube embeddings of dynamic k-ary trees;Eǧecioǧlu;Cong. Numer.,1997