Circuit and decision tree complexity of some number theoretic problems
Information and Computation
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Complexity of some arithmetic problems for binary polynomials
Computational Complexity
Bounds on the Fourier coefficients of the weighted sum function
Information Processing Letters
On the constant-depth complexity of k-clique
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Separations between Nondeterministic and Randomized Multiparty Communication
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
Ehrenfeucht-Fraïssé Games on Random Structures
WoLLIC '09 Proceedings of the 16th International Workshop on Logic, Language, Information and Computation
Variable Influences in Conjunctive Normal Forms
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Bounds on the Size of Small Depth Circuits for Approximating Majority
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
Circuit complexity of testing square-free numbers
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
On the average sensitivity of testing square-free numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
The Fourier entropy-influence conjecture for certain classes of Boolean functions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the average sensitivity of the weighted sum function
Information Processing Letters
On the complexity of parallel hardness amplification for one-way functions
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Approximating the Influence of Monotone Boolean Functions in O(√n) Query Complexity
ACM Transactions on Computation Theory (TOCT)
Approximation by DNF: examples and counterexamples
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
European Journal of Combinatorics
Hi-index | 0.89 |