Author:
Cooper Colin,Ilcinkas David,Klasing Ralf,Kosowski Adrian
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. Aldous, D., Fill, J.: Reversible Markov chains and random walks on graphs. http://stat-www.berkeley.edu/users/aldous/RWG/book.html (2001)
2. Aleliunas, R., Karp, R.M., Lipton R.J., Lovász, L., Rackoff, C.: Random walks, universal sequences and the complexity of maze problems. In: Proceedings of 20th Annual IEEE Symposium on the Foundations of Computer Science (FOCS’79), pp. 218–223 (1979)
3. Ambühl C., Gasieniec L., Pelc A., Radzik T., Zhang X.: Tree exploration with logarithmic memory. ACM Trans. Algorithms 7(2), 17 (2011)
4. Bampas, E., Gasieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A.: Euler tour lock-in problem in the rotor-router model. In: Proceedings of 23rd International Symposium on Distributed Computing (DISC’09), LNCS 5805, pp. 423–435 (2009)
5. Bampas, E., Gasieniec, L., Klasing, R., Kosowski, A., Radzik, T.: Robustness of the rotor-router mechanism. In: Proceedings of 13th International Conference on Principles of Distributed Systems (OPODIS’09), LNCS 5923, pp. 345–358 (2009)
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献