RUSPACE(log n) is contained in DSPACE(log^2 n / loglog n)
Eric Allender, Klaus Lange · Electronic colloquium on computational complexity · 1997
We present a deterministic algorithm running in space O(log^2 n/ loglog 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.