Theory of Computing Systems

, Volume 31, Issue 5, pp 539–550 | Cite as

RUSPACE(log n) \(\subseteq\) DSPACE(log2 n/log log n)

  • E. Allender
  • K.-J. Lange


We present a deterministic algorithm running in space O(log2 n /log log n ) solving the connectivity problem on strongly unambiguous graphs. In addition, we present an O(log n ) time-bounded algorithm for this problem running on a parallel pointer machine.


Deterministic Algorithm Connectivity Problem Parallel Pointer Pointer Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1998

Authors and Affiliations

  • E. Allender
    • 1
  • K.-J. Lange
    • 2
  1. 1.Department of Computer Science, Rutgers University, Piscataway, NJ 08855, USA US
  2. 2.Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany lange@informatik.uni-tuebingen.deDE

Personalised recommendations