SL ⊆L4/3

[1]  David Zuckerman,et al.  Randomness-optimal sampling, extractors, and constructive leader election , 1996, STOC '96.

[2]  Michael E. Saks.  Randomization and derandomization in space-bounded computation , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[3]  Uriel Feige,et al.  Short random walks on graphs , 1993, SIAM J. Discret. Math..

[4]  Mihir Bellare,et al.  Randomness-efficient oblivious sampling , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[5]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computation , 1992, Comb..

[6]  E. Szemerédi,et al.  Undirected connectivity in O(log/sup 1.5/n) space , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[7]  Avi Wigderson,et al.  The Complexity of Graph Connectivity , 1992, MFCS.

[8]  Mihir Bellare,et al.  Randomness in interactive proofs , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[9]  Noam Nisan,et al.  Pseudorandom generators for space-bounded computations , 1990, STOC '90.

[10]  Noam Nisan,et al.  Multiparty protocols and logspace-hard pseudorandom sequences , 1989, STOC '89.

[11]  Christos H. Papadimitriou,et al.  Symmetric Space-Bounded Computation , 1982, Theor. Comput. Sci..

[12]  Richard J. Lipton,et al.  Random walks, universal traversal sequences, and the complexity of maze problems , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[13]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[14]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..