Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Pseudorandom generators without the XOR Lemma (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Hardness and hierarchy theorems for probabilistic quasi-polynomial time
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
SIGACT News complexity theory column 32
ACM SIGACT News
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
On Distribution-Specific Learning with Membership Queries versus Pseudorandom Generation
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
The Non-Recursive Power of Erroneous Computation
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Using nondeterminism to amplify hardness
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Low-end uniform hardness vs. randomness tradeoffs for AM
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Pseudorandomness and Average-Case Complexity Via Uniform Reductions
Computational Complexity
Exposure-Resilient Extractors and the Derandomization of Probabilistic Sublinear Time
Computational Complexity
Worst-Case to Average-Case Reductions Revisited
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
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Hardness amplification within NP against deterministic algorithms
Journal of Computer and System Sciences
Unions of disjoint NP-complete sets
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Marginal hitting sets imply super-polynomial lower bounds for permanent
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Some results on average-case hardness within the polynomial hierarchy
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
On the possibilities and limitations of pseudodeterministic algorithms
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |