Skip to main content
SpringerLink
Log in

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

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract.

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science, Rutgers University, Piscataway, NJ 08855, USA allender@cs.rutgers.edu , , , , , , US

    E. Allender

  2. Wilhelm-Schickard Institut für Informatik, Universität Tübingen, Sand 13, D-72076 Tübingen, Germany lange@informatik.uni-tuebingen.de, , , , , , DE

    K.-J. Lange

Authors
  1. E. Allender
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K.-J. Lange
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received February 1997, and in revised form August 1997, and in final form February 1998.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Allender, E., Lange, KJ. RUSPACE(log n) \(\subseteq\) DSPACE(log2 n/log log n) . Theory Comput. Systems 31, 539–550 (1998). https://doi.org/10.1007/s002240000102

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002240000102

Keywords

Search

Navigation