Quantum lower bounds by quantum arguments
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Complexity measures and decision tree complexity: a survey
Theoretical Computer Science - Complexity and logic
Quantum lower bounds by quantum arguments
Journal of Computer and System Sciences - Special issue on STOC 2000
Every decision tree has an in.uential variable
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Improved Bounds on Quantum Learning Algorithms
Quantum Information Processing
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
Proceedings of the forty-second ACM symposium on Theory of computing
An invariance principle for polytopes
Proceedings of the forty-second ACM symposium on Theory of computing
Unbounded-error quantum query complexity
Theoretical Computer Science
On the average sensitivity of the weighted sum function
Information Processing Letters
An invariance principle for polytopes
Journal of the ACM (JACM)
Sensitivity of Boolean formulas
European Journal of Combinatorics
Hi-index | 0.89 |