STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Computational Complexity
Randomness in interactive proofs
Computational Complexity
Randomness-optimal sampling, extractors, and constructive leader election
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The Complexity of Graph Connectivity
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
Algorithmic derandomization via complexity theory
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Universal traversal sequences with backtracking
Journal of Computer and System Sciences - Complexity 2001
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Log-Space Constructible Universal Traversal Sequences for Cycles of Length O(n4.03)
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
On the Derandomization of Space-Bounded Computations
RANDOM '98 Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science
Log-Space constructible universal traversal sequences for cycles of length O(n4.03)
Theoretical Computer Science - Computing and combinatorics
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
SIGACT news complexity theory column 51
ACM SIGACT News
Estimating PageRank on graph streams
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Some observations on the computational complexity of graph accessibility problem
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Estimating PageRank on graph streams
Journal of the ACM (JACM)
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
| Hi-index | 0.00 |