Work

Random walks, universal traversal sequences, and the complexity of maze problems

Year: 1979

Type: conference-paper

Source: Annual Symposium on Foundations of Computer Science

DOI: 10.1109/sfcs.1979.34

Authors: Romas Aleliunas, Richard M. Karp, Richard J. Lipton, Laszlo Lovasz, Charles Rackoff

Institutions: University of Toronto, University of California, Berkeley, University of Szeged

Language: English

Topic: Complexity and Algorithms in Graphs

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: closed

OpenAlex ID: W2156184725

FWCI: 6.257

Cites: 6

Cited by: 692

Related to: 10