Author:
Avin Chen,Krishnamachari Bhaskar
Subject
Computer Networks and Communications
Reference33 articles.
1. M. Alanyali, V. Saligrama, O. Sava, A random-walk model for distributed computation in energy-limited network, in: Proc. of 1st Workshop on Information Theory and its Application, San Diego, 2006.
2. D. Aldous, J. Fill, Reversible Markov Chains and Random Walks on Graphs. 1999. Unpublished. http://stat-www.berkeley.edu/users/aldous/RWG/book.html.
3. Lower bounds for covering times for reversible Markov chains and random walks on graphs;Aldous;J. Theor. Prob.,1989
4. R. Aleliunas, R.M. Karp, R.J. Lipton, L. Lovász, C. Rackoff, Random walks, universal traversal sequences, and the complexity of maze problems, in: 20th Annual Symposium on Foundations of Computer Science (San Juan, Puerto Rico, 1979), IEEE, New York, 1979, pp. 218–223.
5. C. Avin, C. Brito, Efficient and robust query processing in dynamic environments using random walk techniques, in: Proc. of the Third International Symposium on Information processing in sensor networks, 2004, pp. 277–286.
Cited by
25 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献