Time-space lower bounds for undirected and directed st-connectivity on JAG models Je A. Edmonds Doctor of Philosophy 1993 Department of Computer Science University of Toronto Directed and undirected st-connectivity are important problems in computing. There are algorithms for the undirected case that use O (n) time and algorithms that use O (logn) space. The rst result of this thesis proves tha...