R. Kaxp, M. Luby, and A. Maxchetti-Spaccamela. A probabilistic analysis of multidimensional bin packing problems. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pages 289-298, 1984. Home/Search Document Not in Database Summary Related Articles |
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. Kaxp, M. Luby, and A. Maxchetti-Spaccamela. A probabilistic analysis of multidimensional bin packing problems. In Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing, pages 289-298, 1984.
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