1. Alon, N., Avin, C., Koucky, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many Random Walks Are Faster Than One. ArXiv e-prints 705 (May 2007),
http://arxiv.org/abs/0705.0467
2. Aldous, D., Fill, J.: Reversible Markov Chains and Random Walks on Graphs (1999),
http://www.stat.berkeley.edu/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 (FOCS), San Juan, Puerto Rico, October 29-31, 1979, pp. 218–223. IEEE Computer Society Press, Los Alamitos (1979)
4. Ajtai, M., Komlós, J., Szemerédi, E.: Deterministic simulation in LOGSPACE. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing (STOC), New York City, May 25-27, 1987, pp. 132–140 (1987)
5. Barnes, G., Feige, U.: Short random walks on graphs. In: STOC, pp. 728–737 (1993)