STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs
Journal of the ACM (JACM)
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
SIGACT news complexity theory column 51
ACM SIGACT News
A survey of lower bounds for satisfiability and related problems
Foundations and Trends® in Theoretical Computer Science
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
Arithmetizing classes around NC1and L
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Pseudorandom generators for group products: extended abstract
Proceedings of the forty-third annual ACM symposium on Theory of computing
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
On obtaining pseudorandomness from error-correcting codes
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Time-space lower bounds for the polynomial-time hierarchy on randomized machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
Hi-index | 0.00 |