Skip to main content
Book Chapter

LOGSPACE, Random Walks on Graphs, and Universal Traversal Sequences

  • Schöning U
  • Pruim R
Springer Berlin Heidelberg, (1998), 41-47
DOI: 10.1007/978-3-642-60322-8_6
N/ACitations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Cite

CITATION STYLE

APA

Schöning, U., & Pruim, R. (1998). LOGSPACE, Random Walks on Graphs, and Universal Traversal Sequences. In Gems of Theoretical Computer Science (pp. 41–47). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-642-60322-8_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free