1. Random walks, universal traversal sequences, and complexity of maze problems;Aleliunas,1979
2. Optimal parallel algorithms for the connected components problem;Chin,1981
3. An observation on time-storage trade off;Cook;J. Comput. System Sci.,1974
4. Towards a complexity theory of synchronous parallel computation;Cook,1980
5. Linear programming is log-space hard for P;Dobkin;Inform. Process. Lett.,1979