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 Summary Related Articles Check |
This paper is cited in the following contexts:
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (3 citations) (Correct)
....ACM 1 58113 349 9 01 0007 . 5.00. moves one position left or right, depending on the flip of a fair coin. Such random walks may be generalized to more complicated lattices and to finite or infinite graphs, and have had several interesting applications in computer science (see, for instance, [3, 8, 20, 22], as well as the discussion below) We refer the reader to Kemeny and Snell [21] for basic facts regarding random walks. In this paper we consider quantum variations of random walks on one dimensional lattices we refer to such processes as quantum walks. In direct analogy to classical random ....
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.
Quantum Random Walks and the Analysis of Discrete Quantum.. - Ambainis, Bach, Watrous (2000) (Correct)
....lattice. At each step, the particle moves one position left or right, depending on the ip of a fair coin. Such random walks may be generalized to more complicated lattices and to nite or in nite graphs, and have had several interesting applications in computer science (see, for instance, [2, 3, 8, 10]) We refer the reader to Kemeny and Snell [9] for basic facts regarding random walks. In this paper we consider quantum variations of random walks on one dimensional lattices we refer to such quantum processes as quantum random walks. Although our basic de nition looks quite similar to the ....
R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Racko . 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.
Quantum Simulations of Classical Random Walks and Undirected.. - Watrous (1999) (3 citations) (Correct)
....vertex v is defined to be 1=d in case v is adjacent to u, and zero otherwise. The study of random walks has had a number of interesting applications in complexity theory. From the perspective of this paper, the most important such application is due to Aleliunas, Karp, Lipton, Lov asz and Rackoff [2], who used random walks to show that the undirected graph connectivity (USTCON) problem is in RHL (sometimes denoted RL poly or just RL) Since USTCON is complete for symmetric logspace (SL) with respect to logspace reductions [10] the relation SL RHL follows. The most space efficient known ....
R. Aleliunas, R. Karp, R. Lipton, L. Lov'asz, 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.
One-Dimensional Quantum Walks - Ambainis, Bach, Nayak, Vishwanath.. (3 citations) Self-citation (Walks) (Correct)
....2001 ACM 1 58113 349 9 01 0007 . 5.00. moves one position left or right, depending on the ip of a fair coin. Such random walks may be generalized to more complicated lattices and to nite or in nite graphs, and have had several interesting applications in computer science (see, for instance, [3, 8, 20, 22], as well as the discussion below) We refer the reader to Kemeny and Snell [21] for basic facts regarding random walks. In this paper we consider quantum variations of random walks on one dimensional lattices we refer to such processes as quantum walks. In direct analogy to classical random ....
R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Racko . 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.
Quantum Simulations of Classical Random Walks and Undirected.. - Watrous (1998) (3 citations) Self-citation (Walks) (Correct)
....to vertex v is defined to be 1 d in case v is adjacent to u, and zero otherwise. The study of random walks has had a number of interesting applications in complexity theory. From the perspective of this paper, the most important such application is due to Aleliunas, Karp, Lipton, Lovasz and Racko# [1], who used random walks to show that the undirected graph connectivity problem # Part of this work was performed while the author was at the University of Wisconsin Madison Computer Sciences Department under the support of NSF grant CCR 95 10244. canbesolvedinR HL (sometimes written RL poly ....
R. Aleliunas, R. Karp, R. Lipton, L. Lovasz, and C. Racko#. 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.
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