Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Progress in computational complexity theory
Journal of Computer Science and Technology
Undirected connectivity in log-space
Journal of the ACM (JACM)
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
On the complexity of differentially private data release: efficient algorithms and hardness results
Proceedings of the forty-first annual ACM symposium on Theory of computing
Pseudorandom Bit Generators That Fool Modular Sums
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Linear advice for randomized logarithmic space
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Inverting well conditioned matrices in quantum logspace
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.00 |