Download:
|
|
by Roy Armoni, Amnon Ta-shma, Avi Wigderson, Shiyu Zhou
http://www.icsi.berkeley.edu/~amnon/Papers/dsl.ps.Z
Add To MetaCart
Abstract:
We present a deterministic algorithm that computes st-connectivity in undirected graphs using O(log
Citations
| 225 | Relationships between nondeterministic and deterministic tape complexities – Savitch - 1970 |
| 129 | Random walks, universal traversal sequences, and the complexity of maze problems – Aleliunas, Karp, et al. - 1979 |
| 126 | Pseudo random generators for space-bounded computation – Nisan |
| 45 | Randomness-efficient oblivious sampling – Bellare, Rompel - 1994 |
| 41 | Symmetric space-bounded computation – Lewis, Papadimitriou - 1982 |
| 28 | Randomness in interactive proofs – Bellare, Goldreich, et al. - 1993 |
| 27 | The complexity of graph connectivity – Wigderson - 1992 |
| 26 | Short random walks on graphs – Barnes, Feige - 1996 |
| 26 | Randomness-optimal sampling, extractors, and constructive leader election – Zuckerman - 1996 |
| 23 | Randomization and derandomization in space-bounded computation – Saks - 1996 |
| 11 | Endre Szemer'edi, and Avi Wigderson. Undirected connectivity in O(log 1:5 n) space – Nisan - 1992 |
| 1 | Private communication. Unpublished manuscript – Linial - 1992 |
| 1 | RSPACE(S) ae DSPACE(S 2 – Saks, Zhou - 1995 |
