Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems
R. Aleliunas and R.M. Karp and R.J. Lipton and L. Lovasz and C. Rackoff
EECS Department, University of California, Berkeley
Technical Report No. UCB/ERL M79/54
, 1979
http://www2.eecs.berkeley.edu/Pubs/TechRpts/1979/ERL-m-79-54.pdf
BibTeX citation:
@techreport{Aleliunas:M79/54, Author= {Aleliunas, R. and Karp, R.M. and Lipton, R.J. and Lovasz, L. and Rackoff, C.}, Title= {Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems}, Year= {1979}, Month= {Aug}, Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/1979/29132.html}, Number= {UCB/ERL M79/54}, }
EndNote citation:
%0 Report %A Aleliunas, R. %A Karp, R.M. %A Lipton, R.J. %A Lovasz, L. %A Rackoff, C. %T Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems %I EECS Department, University of California, Berkeley %D 1979 %@ UCB/ERL M79/54 %U http://www2.eecs.berkeley.edu/Pubs/TechRpts/1979/29132.html %F Aleliunas:M79/54