How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
On relativized exponential and probabilistic complexity classes
Information and Control
Nearly optimal hierarchies for network and formula size
Acta Informatica
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
A Las Vegas RNC algorithm for maximum matching
Combinatorica
Recognizing primes in random polynomial time
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Does co-NP have short interactive proofs?
Information Processing Letters
Problems complete for deterministic logarithmic space
Journal of Algorithms
Short propositional formulas represent nondeterministic computations
Information Processing Letters
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
The method of forced enumeration for nondeterministic automata
Acta Informatica
Nondeterministic space is closed under complementation
SIAM Journal on Computing
On the power of two-point based sampling
Journal of Complexity
A hard-core predicate for all one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Very fast parallel polynomial arithmetic
SIAM Journal on Computing
Prediction-preserving reducibility
Journal of Computer and System Sciences - 3rd Annual Conference on Structure in Complexity Theory, June 14–17, 1988
Category and measure in complexity classes
SIAM Journal on Computing
Coherent functions and program checkers
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
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
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Almost everywhere high nonuniform complexity
Journal of Computer and System Sciences
On sparse hard sets for counting classes
Theoretical Computer Science
On read-once vs. multiple access to randomness in logspace
Theoretical Computer Science - Special issue on structure in complexity theory
Random-self-reducibility of complete sets
SIAM Journal on Computing
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
On being incoherent without being very hard
Computational Complexity
Gap-definable counting classes
Journal of Computer and System Sciences
On reductions of NP sets to sparse sets
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The Complexity and Distribution of Hard Problems
SIAM Journal on Computing
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
Genericity and measure for exponential time
MFCS '94 Selected papers from the 19th international symposium on Mathematical foundations of computer science
An excursion to the Kolmogorov random strings
Journal of Computer and System Sciences - special issue on complexity theory
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
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue: 26th annual ACM symposium on the theory of computing & STOC'94, May 23–25, 1994, and second annual Europe an conference on computational learning theory (EuroCOLT'95), March 13–15, 1995
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
Complexity theory retrospective II
The quantitative structure of exponential time
Complexity theory retrospective II
Construction of extractors using pseudo-random generators (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph Ramsey theory and the polynomial hierarchy
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
Journal of Computer and System Sciences - Eleventh annual conference on structure and complexity 1996
A Pseudorandom Generator from any One-way Function
SIAM Journal on Computing
Sparse hard sets for P: resolution of a conjecture of Hartmanis
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Isolation, matching and counting uniform and nonuniform upper bounds
Journal of Computer and System Sciences
Journal of Computer and System Sciences
The zero-one law holds for BPP
Theoretical Computer Science
Separating Complexity Classes Using Autoreducibility
SIAM Journal on Computing
Resolution of Hartmanis' conjecture for NL-hard sparse sets
Theoretical Computer Science - computing and combinatorics
Introduction to Coding Theory
A Generalization of Resource-Bounded Measure, with Application to the BPP vs. EXP Problem
SIAM Journal on Computing
Machine Learning
Machine Learning
Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
On the Existence of Hard Sparse Sets under Weak Reductions
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
On Bounded Truth-Table, Conjunctive, and Randomized Reductions to Sparse Sets
Proceedings of the 12th Conference on Foundations of Software Technology and Theoretical Computer Science
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
Proceedings of the Symposium "Rekursive Kombinatorik" on Logic and Machines: Decision Problems and Complexity
Results on Resource-Bounded Measure
ICALP '97 Proceedings of the 24th International Colloquium on Automata, Languages and Programming
Reducing P to a Sparse Set using a Constant Number of Queries Collapses P to L
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
COCO '98 Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity
Pseudorandom generators, measure theory, and natural proofs
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Using autoreducibility to separate complexity classes
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
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
On some deterministic space complexity problems
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A complexity theoretic approach to randomness
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A small span theorem for P/Poly-Turing reductions
SCT '95 Proceedings of the 10th Annual Structure in Complexity Theory Conference (SCT'95)
The circuit value problem is log space complete for P
ACM SIGACT News
Two theorems on random polynomial time
SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
On simultaneous resource bounds
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Computational complexity and the classification of finite simple groups
SFCS '83 Proceedings of the 24th Annual Symposium on Foundations of Computer Science
Measure on small complexity classes, with applications for BPP
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
The equivalence problem for regular expressions with squaring requires exponential space
SWAT '72 Proceedings of the 13th Annual Symposium on Switching and Automata Theory (swat 1972)
Hierarchies of memory limited computations
FOCS '65 Proceedings of the 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965)
| Hi-index | 0.00 |