A nearly optimal time-space lower bound for directed st-connectivity on the NNJAG model

A time-space tradeoff for element distinctness

SIAM Journal on Computing

The method of forced enumeration for nondeterministic automata

Acta Informatica

Nondeterministic space is closed under complementation

SIAM Journal on Computing

A general sequential time-space tradeoff for finding unique elements

SIAM Journal on Computing

The asymptotic optimality of spider-web networks

Discrete Applied Mathematics - Special double volume: interconnection networks

Time-space trade-offs for undirected st-connectivity on a JAG

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Lower bounds on the length of universal traversal sequences

Journal of Computer and System Sciences

Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs

Journal of Computer and System Sciences

Time-space lower bounds for undirected and directed ST-connectivity on jag models

Time-space lower bounds for undirected and directed ST-connectivity on jag models

The complexity of verification

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing

Reachability and the power of local ordering

STACS '94 Selected papers of the eleventh symposium on Theoretical aspects of computer science

Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models

SIAM Journal on Computing

A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity

SIAM Journal on Computing

The Complexity of Graph Connectivity

MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science

Time-space tradeoffs for branching programs contrasted with those for straight-line programs

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science