1. Alanyali, M., Saligrama, V., Sava, O.: 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. Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (unpublished, 1999), http://stat-www.berkeley.edu/users/aldous/RWG/book.html
3. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovász, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: 20th Annual Symposium on Foundations of Computer Science, San Juan, Puerto Rico, pp. 218–223. IEEE, New York (1979)
4. Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. In: 20th ACM Symposium on Parallelism in Algorithms and Architectures (to appear, 2008)
5. Avin, C., Brito, C.: 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, pp. 277–286 (2004)