1. Savitch, W.J.: Relationships between nondeterministic and deterministic tape complexities. J. Comput. Syst. Sci. 4, 177–192 (1970)
2. Wigderson, A.: The complexity of graph connectivity. In: Mathematical Foundations of Computer Science, pp. 112–132 (1992)
3. Barnes, G., Buss, J.F., Ruzzo, W.L., Schieber, B.: A sublinear space, polynomial time algorithm for directed s-t connectivity. In: Proceedings of the Seventh Annual Structure in Complexity Theory Conference, pp. 27–33 (1992)
4. Imai, T., Nakagawa, K., Pavan, A., Vinodchandran, N.V., Watanabe, O.: An O(n1/2 + ε)-Space and Polynomial-Time Algorithm for Directed Planar Reachability. In: 2013 IEEE Conference on Computational Complexity (CCC), pp. 277–286 (2013)
5. Chakraborty, D., Pavan, A., Tewari, R., Vinodchandran, N.V., Yang, L.: New time-space upperbounds for directed reachability in high-genus and $h$-minor-free graphs. Electronic Colloquium on Computational Complexity (ECCC) 21, 35 (2014)