R. Aleliunas, R. Karp, R. Lipton, L. Lov&sz, and C. Rackoff. Random walks, universal traversal sequences, and the time complexity of maze problems. In Proceedings of the 20th Annual Symposium on Foundations of Computer Science, pages 218-223, 1979. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (3 citations) (Correct)
Quantum Random Walks and the Analysis of Discrete Quantum.. - Ambainis, Bach, Watrous (2000) (Correct)
Quantum Simulations of Classical Random Walks and Undirected.. - Watrous (1999) (3 citations) (Correct)
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (3 citations) Self-citation (Walks) (Correct)
Quantum Simulations of Classical Random Walks and Undirected.. - Watrous (1998) (3 citations) Self-citation (Walks) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC