How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
On hiding information form an oracle
Journal of Computer and System Sciences
Hiding instances in multioracle queries
STACS 90 Proceedings of the seventh annual symposium on Theoretical aspects of computer science
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Random-self-reducibility of complete sets
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Journal of Computer and System Sciences
Designing programs that check their work
Journal of the ACM (JACM)
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Journal of Computer and System Sciences
P = BPP if E requires exponential circuits: derandomizing the XOR lemma
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Chinese remaindering with errors
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
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Weak Random Sources, Hitting Sets, and BPP Simulations
SIAM Journal on Computing
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Bounds for Dispersers, Extractors, and Depth-Two Superconcentrators
SIAM Journal on Discrete Mathematics
Separating Complexity Classes Using Autoreducibility
SIAM Journal on Computing
Pseudorandom generators without the XOR lemma
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Worst-Case Hardness Suffices for Derandomization: A New Method for Hardness-Randomness Trade-Offs
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
A Probabilistic-Time Hierarchy Theorem for "Slightly Non-uniform" Algorithms
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Randomness vs. Time: De-Randomization under a Uniform Assumption
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A personal view of average-case complexity
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
Comparing Notions of Full Derandomization
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Pseudorandomness and Average-Case Complexity via Uniform Reductions
CCC '02 Proceedings of the 17th IEEE Annual Conference on Computational Complexity
List-Decoding Using The XOR Lemma
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
Hierarchy Theorems for Probabilistic Polynomial Time
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Simple extractors for all min-entropies and a new pseudorandom generator
Journal of the ACM (JACM)
Hierarchies for semantic classes
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The complexity of constructing pseudorandom generators from hard functions
Computational Complexity
On the Complexity of Hardness Amplification
CCC '05 Proceedings of the 20th Annual IEEE Conference on Computational Complexity
A Generic Time Hierarchy for Semantic Models with One Bit of Advice
CCC '06 Proceedings of the 21st Annual IEEE Conference on Computational Complexity
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
A lower bound on list size for list decoding
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
Computational Complexity
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Complexity of Local List Decoding
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Limitations of Hardness vs. Randomness under Uniform Reductions
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Typically-correct derandomization
ACM SIGACT News
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Studies in complexity and cryptography
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Limits on the computational power of random strings
Information and Computation
Permanent does not have succinct polynomial size arithmetic circuits of constant depth
Information and Computation
| Hi-index | 0.00 |