Journal of the ACM Bibliography
Sandeep Bhatt and Jin-Yi Cai. Taking random walks to
grow trees in hypercubes. Journal of the ACM,
40(3):741-764, July 1993.
[BibTeX entry]
Selected papers that cite this one
- Sajal K. Das and M. Cristina Pinotti. O(log log
N) time algorithms for Hamiltonian suffix and min-max-pair
heap operations on the hypercube. Journal of Parallel and
Distributed Computing, 48(2):200-211, 1 February 1998.
- Volker Heun and Ernst W. Mayr. A new efficient
algorithm for embedding an arbitrary binary tree into its optimal
hypercube. Journal of Algorithms, 20(2):375-399, March
1996.
- Keqin Li, Yi Pan, Hong Shen, Gilbert H. Young, and Si Qing Zheng. Lower bounds for
dynamic tree embedding in bipartite networks. Journal of
Parallel and Distributed Computing, 53(2):119-143, 15 September
1998.
- Hong Shen, K. Li, Y. Pan, G. H. Young, and S. Q. Zhang. Performing analysis
for dynamic tree embedding in k-partite networks bya random
walk. Journal of Parallel and Distributed Computing,
50(1):144-156, 1 May 1998.
- Jan Trdli\v{c}ka and Pavel Tvrdík. Embedding of
k-ary complete trees into hypercubes with uniform load.
Journal of Parallel and Distributed Computing,
51(2):120-131, 1 August 1998.
Selected references
- Sandeep Bhatt, Fan Chung, Tom Leighton, and Arnold Rosenberg. Optimal simulations of
tree machines (preliminary version). In 27th Annual Symposium
on Foundations of Computer Science, pages 274-282, Toronto,
Ontario, Canada, 27-29 October 1986. IEEE.
- Richard M. Karp and Yanjun Zhang. A randomized parallel
branch-and-bound procedure. In Proceedings of the Twentieth
Annual ACM Symposium on Theory of Computing, pages 290-300,
Chicago, Illinois, 2-4 May 1988.
Shortcuts: