STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
The complexity of planarity testing
Information and Computation
On the complexity of simulating space-bounded quantum computations
Computational Complexity
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Quantum branching programs and space-bounded nonuniform quantum complexity
Theoretical Computer Science
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
NL-printable sets and nondeterministic Kolmogorov complexity
Theoretical Computer Science - Logic, language, information and computation
Undirected connectivity in log-space
Journal of the ACM (JACM)
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Randomness-Efficient Sampling within NC1
Computational Complexity
Derandomization of Euclidean Random Walks
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How strong is Nisan's pseudo-random generator?
Information Processing Letters
The computational complexity of estimating MCMC convergence time
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Randomness-efficient sampling within NC1
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Generalized strong extractors and deterministic privacy amplification
IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Infinite vs. finite size-bounded randomized computations
Journal of Computer and System Sciences
Proving the Power of Postselection
Fundamenta Informaticae - MFCS & CSL 2010 Satellite Workshops: Selected Papers
| Hi-index | 0.00 |
This is a survey of space-bounded probabilistic computation, summarizing the present state of knowledge about the relationships between the various complexity classes associated with such computation. The survey especially emphasizes recent progress in the construction of pseudorandom generators that fool probabilistic space-bounded computations, and the application of such generators to obtain deterministic simulations.