Taking random walks to grow trees in hypercubes-Reference-Cited by-同舟云学术

Taking random walks to grow trees in hypercubes

Published:1993-07 Issue:3 Volume:40 Page:741-764
ISSN:0004-5411
Container-title:Journal of the ACM
language:en
Short-container-title:J. ACM

Author:

Bhatt Sandeep¹,Cai Jin-Yi²

Affiliation:

1. Bellcore, Morristown, NJ

2. Princeton Univ., Princeton, NJ

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Hardware and Architecture,Information Systems,Control and Systems Engineering,Software

Reference14 articles.

1. ~ALDOUS D. Minimization algorithms and random walk on the d-cube. Ann. Prob. H 2 ~(1983) 403-413. ~ALDOUS D. Minimization algorithms and random walk on the d-cube. Ann. Prob. H 2 ~(1983) 403-413.

2. ~BHATT S. N. AND IPSEN I. How to embed trees in hypercubes. Yale Univ. Res. Rep. ~RR-443. ~BHATT S. N. AND IPSEN I. How to embed trees in hypercubes. Yale Univ. Res. Rep. ~RR-443.

3. Adaptive load sharing in homogenous dis- ~tributed systems;~EAGER;IEEE Trans. Sofiw. Eng. SE-12,1986

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks;Journal of Parallel and Distributed Computing;2010-09

2. A Random-Walk-Based Dynamic Tree Evolution Algorithm with Exponential Speed of Convergence to Optimality on Regular Networks;2009 Fourth International Conference on Frontier of Computer Science and Technology;2009-12

3. Hamming Codes, Hypercube Embeddings, and Fault Tolerance;SIAM Journal on Computing;2007-01

4. Design and analysis of asymptotically optimal randomized tree embedding algorithms in static networks;Performance Evaluation;2005-05

5. Increasing the Training Speed of SVM, the Zoutendijk Algorithm Case;Advanced Distributed Systems;2005