STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On Learning Embedded Midbit Functions
ALT '02 Proceedings of the 13th International Conference on Algorithmic Learning Theory
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The correlation between parity and quadratic polynomials mod 3
Journal of Computer and System Sciences - Special issue on computational complexity 2002
On learning embedded midbit functions
Theoretical Computer Science - Algorithmic learning theory(ALT 2002)
Combinatorics, Probability and Computing
Quantum multiparty communication complexity and circuit lower bounds
Mathematical Structures in Computer Science
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Quantum multiparty communication complexity and circuit lower bounds
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
An algebraic perspective on Boolean function learning
ALT'09 Proceedings of the 20th international conference on Algorithmic learning theory
Nexp does not have non-uniform quasipolynomial-size ACC circuits of o(log log n) depth
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Guest column: a casual tour around a circuit complexity bound
ACM SIGACT News
Algorithms for modular counting of roots of multivariate polynomials
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
The NOF multiparty communication complexity of composed functions
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Natural proofs versus derandomization
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Nonuniform ACC Circuit Lower Bounds
Journal of the ACM (JACM)
Degree lower bounds of tower-type for approximating formulas with parity quantifiers
ACM Transactions on Computational Logic (TOCL)
Optimal Collapsing Protocol for Multiparty Pointer Jumping
Theory of Computing Systems
| Hi-index | 0.00 |