Session 5b: Invited Presentation

Algorithms and Computation

Volume 1178 of the series Lecture Notes in Computer Science pp 193-202


StUSPACE(log n) ⊂-DSPACE(log2 n/log log n)

  • Eric AllenderAffiliated withDepartment of Computer Science, Rutgers University
  • , Klaus-Jörn LangeAffiliated withWilhelm-Schickard Institut für Informatik, Universität Tübingen

* Final gross prices may vary according to local VAT.

Get Access


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.