Relativized polynomial time hierarchies having exactly K levels
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Optimal bounds for decision problems on the CRCW PRAM
Journal of the ACM (JACM)
Exponential lower bounds for the pigeonhole principle
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Cryptographic lower bounds for learnability of Boolean functions on the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
An O(nlog log n) learning algorithm for DNF under the uniform distribution
COLT '92 Proceedings of the fifth annual workshop on Computational learning theory
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
An Ω(√ log log n) lower bound for routing in optical networks
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
ACM SIGACT News
Strategic directions in research in theory of computing
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
Journal of the ACM (JACM)
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A Note on Universal Measures for Weak Implicit Computational Complexity
LPAR '02 Proceedings of the 9th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
On the Complexity of Free Monoid Morphisms
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
The Query Complexity of Program Checking by Constant-Depth Circuits
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An Exact Characterization of Symmetric Functions in qAC0[2]
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Functional Inversion and Communication Complexity
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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
Resolution Refutations and Propositional Proofs with Height-Restrictions
CSL '02 Proceedings of the 16th International Workshop and 11th Annual Conference of the EACSL on Computer Science Logic
On Learning Monotone DNF under Product Distributions
COLT '01/EuroCOLT '01 Proceedings of the 14th Annual Conference on Computational Learning Theory and and 5th European Conference on Computational Learning Theory
Circuit Bottom Fan-in and Computational Power
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Lower Bound For Perceptrons And An Oracle Separation Of The PP/sup PH/ Hierarchy
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Some connections between bounded query classes and non-uniform complexity
Information and Computation
Uniform-distribution attribute noise learnability
Information and Computation
Journal of Computer and System Sciences - STOC 2001
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On learning monotone DNF under product distributions
Information and Computation
Recursion schemata for slowly growing depth circuit classes
Computational Complexity
Hausdorff dimension and oracle constructions
Theoretical Computer Science
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Hardness amplification proofs require majority
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Randomness-Efficient Sampling within NC1
Computational Complexity
The Polynomial and Linear Hierarchies in V0
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
Cryptographic hardness for learning intersections of halfspaces
Journal of Computer and System Sciences
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
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
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Amplifying lower bounds by means of self-reducibility
Journal of the ACM (JACM)
Finding a duplicate and a missing item in a stream
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
BQP and the polynomial hierarchy
Proceedings of the forty-second ACM symposium on Theory of computing
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Learning and lower bounds for AC0 with threshold gates
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
The computational complexity of linear optics
Proceedings of the forty-third annual ACM symposium on Theory of computing
Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Archive for Mathematical Logic
Learning unions of ω(1)-dimensional rectangles
ALT'06 Proceedings of the 17th international conference on Algorithmic Learning Theory
On beating the hybrid argument
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
A satisfiability algorithm for AC0
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Constant-Depth circuits for arithmetic in finite fields of characteristic two
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Lower bounds for circuits with few modular and symmetric gates
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Exponential lower bound for bounded depth circuits with few threshold gates
Information Processing Letters
On the correlation between parity and modular polynomials
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
The computational complexity of one-dimensional sandpiles
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
The Complexity of Distributions
SIAM Journal on Computing
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Computing symmetric boolean functions by circuits with few exact threshold gates
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Graph Isomorphism is Not AC0-Reducible to Group Isomorphism
ACM Transactions on Computation Theory (TOCT)
Candidate weak pseudorandom functions in AC0 ○ MOD2
Proceedings of the 5th conference on Innovations in theoretical computer science
| Hi-index | 0.00 |