Author:
Klasing Ralf,Kosowski Adrian,Pająk Dominik,Sauerwald Thomas
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference27 articles.
1. Akbari, H., Berenbrink, P.: Parallel rotor walks on finite graphs and applications in discrete load balancing. In: Blelloch, G.E., Vöcking, B. (eds.) 25th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA’13, Montreal, QC, Canada, July 23–25, 2013. ACM, pp. 186–195 (2013)
2. Aldous, D., Fill, J. A.: Reversible Markov Chains and Random Walks on Graphs (1995) http://stat-www.berkeley.edu/users/aldous/RWG/book.html
3. Aleliunas, R., Karp, R.M., Lipton, R.J., Lovasz, L., Rackoff, C.: Random walks, universal traversal sequences, and the complexity of maze problems. In: Proceedings of the 20th Annual Symposium on Foundations of Computer Science, FOCS’79, Washington, DC, USA, 1979. IEEE Computer Society, pp. 218–223 (1979)
4. Alon, N., Avin, C., Koucký, M., Kozma, G., Lotker, Z., Tuttle, M.R.: Many random walks are faster than one. Comb. Probab. Comput. 20(4), 481–502 (2011)
5. Anderson, R., Lovasz, L., Shor, P., Spencer, J., Tardos, E., Winograd, S.: Disks, balls, and walls: analysis of a combinatorial game. Am. Math. Mon. 96(6), 481–493 (1989)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献