Author:
Elsässer Robert,Sauerwald Thomas
Subject
General Computer Science,Theoretical Computer Science
Reference30 articles.
1. M. Adler, E. Halperin, R. Karp, V. Vazirani, A stochastic process on the hypercube with applications to peer-to-peer networks, in: 35th Annual ACM Symposium on Theory of Computing, STOC’03, 2003, pp. 575–584.
2. D. Aldous, J. Fill, Reversible Markov Chains and Random Walks on Graphs, 2002 (in preparation). Draft available at http://www.stat.berkeley.edu/~aldous/RWG/book.html.
3. On the time taken by random walks on finite groups to visit every state;Aldous;Zeitschrift für Wahrscheinlichkeitstheorie und verwandte Gebiete,1983
4. R. Aleliunas, R. Karp, R. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annual IEEE Symposium on Foundations of Computer Science, FOCS’79, 1979, pp. 218–223.
5. N. Alon, C. Avin, M. Koucky, G. Kozma, Z. Lotker, M. Tuttle, Many random walks are faster than one, in: 20th Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA’08, 2008, pp. 119–128.
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献