1. Random walks, universal traversal sequences, and the complexity of maze problems;Aleliunas,1979
2. Bounded-Width Polynomial-Size Branching Programs Recognize Exactly Those Languages in NC1;Barrington,1986
3. On relating time and space to size and depth;Borodin;SIAM J. Comput.,1977
4. Towards a Complexity Theory of Synchronous Parallel Computation;Cook,1981
5. A taxonomy of problems with fast parallel algorithms;Cook;Inform. and Control,1985