Constructing set systems with prescribed intersection sizes
Journal of Algorithms
Computational complexity of neural networks: a survey
Nordic Journal of Computing
Upper and Lower Bounds for Some Depth-3 Circuit Classes
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
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
Theoretical Computer Science
Guest Column: correlation bounds for polynomials over {0 1}
ACM SIGACT News
Improved Separations between Nondeterministic and Randomized Multiparty Communication
ACM Transactions on Computation Theory (TOCT)
On the Power of Small-Depth Computation
Foundations and Trends® in Theoretical Computer Science
Hardness Amplification Proofs Require Majority
SIAM Journal on Computing
Correlation bounds for poly-size AC0 circuits with n1-o(1) symmetric gates
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Lower bounds for linear decision trees via an energy complexity argument
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations 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
On the correlation between parity and modular polynomials
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
The multiparty communication complexity of set disjointness
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
| Hi-index | 0.89 |