How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
NP is as easy as detecting unique solutions
Theoretical Computer Science
Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Structural complexity 1
Arthur-Merlin games: a randomized proof system, and a hierarchy of complexity class
Journal of Computer and System Sciences - 17th Annual ACM Symposium in the Theory of Computing, May 6-8, 1985
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Journal of the ACM (JACM)
PP is as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Counting classes are at least as hard as the polynomial-time hierarchy
SIAM Journal on Computing
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
Gap-definable counting classes
Journal of Computer and System Sciences
Journal of Computer and System Sciences
BPP has subexponential time simulations unless EXPTIME has publishable proofs
Computational Complexity
Oracles and queries that are sufficient for exact learning
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
Complexity theory retrospective II
Machine Learning
Machine Learning
On Resource-Bounded Measure and Pseudorandomness
Proceedings of the 17th Conference on Foundations of Software Technology and Theoretical Computer Science
Super-bits, Demi-bits, and NP/qpoly-natural Proofs
RANDOM '97 Proceedings of the International Workshop on Randomization and Approximation Techniques in Computer Science
Hard-core distributions for somewhat hard problems
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Extracting all the Randomness from a Weakly Random Source
Extracting all the Randomness from a Weakly Random Source
Extractors and pseudo-random generators with optimal seed length
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
On transformation of interactive proofs that preserve the prover's complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Extractors and pseudorandom generators
Journal of the ACM (JACM)
Pseudo-random generators for all hardnesses
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
In search of an easy witness: exponential time vs. probabilistic polynomial time
Journal of Computer and System Sciences - Complexity 2001
On Interactive Proofs with a Laconic Prover
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Derandomizing Arthur-Merlin Games under Uniform Assumptions
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Optimal Proof Systems and Sparse Sets
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Some Results on Derandomization
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
When Worlds Collide: Derandomization, Lower Bounds, and Kolmogorov Complexity
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Error-Correcting Codes and Pseudorandom Projections
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Derandomization of Constant Depth Circuits
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Derandomizing polynomial identity tests means proving circuit lower bounds
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Derandomizing Arthur-Merlin Games Using Hitting Sets
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Pseudo-random generators for all hardnesses
Journal of Computer and System Sciences - STOC 2002
On interactive proofs with a laconic prover
Computational Complexity
Uniform hardness versus randomness tradeoffs for Arthur-Merlin games
Computational Complexity
Zero knowledge with efficient provers
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
On the randomness complexity of efficient sampling
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
Baire categories on small complexity classes and meager--comeager laws
Information and Computation
Martingale families and dimension in P
Theoretical Computer Science
Algebrization: A New Barrier in Complexity Theory
ACM Transactions on Computation Theory (TOCT)
A zero-one law for RP and derandomization of AM if NP is not small
Information and Computation
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
Robust simulations and significant separations
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Martingale families and dimension in p
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Arthur-Merlin games and the problem of isomorphism testing
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Impossibility results on weakly black-box hardness amplification
FCT'07 Proceedings of the 16th international conference on Fundamentals of Computation Theory
| Hi-index | 0.00 |