New algorithms and lower bounds for monotonicity testing.
with Xi Chen and Rocco Servedio.
Approximate resilience, monotonicity, and the complexity of agnostic learning.
with Dana Dachman-Soled, Vitaly Feldman, Andrew Wan, and Karl Wimmer.
On DNF approximators for monotone Boolean functions.
with Eric Blais, Johan Håstad, and Rocco Servedio.
Learning circuits with few negations.
with Eric Blais, Clément Canonne, Igor Carboni Oliveira, and Rocco Servedio.
A composition theorem for parity kill number.
with Ryan O'Donnell, Xiaorui Sun, John Wright, and Yu Zhao.
Discrete isoperimetry via the entropy method.
with Eric Blais and Andrew Wan.
Hypercontractive inequalities via SOS, and the Frankl-Rödl graph.
with Manuel Kauers, Ryan O'Donnell, and Yuan Zhou.
Learning sums of independent integer random variables.
On the average sensitivity and density of k-CNF formulas.
with Dominik Scheder.
A composition theorem for the Fourier Entropy-Influence conjecture.
with Ryan O'Donnell.
Hypercontractivity via the entropy method.
Approximating Boolean functions with depth-2 circuits.
New NP-hardness results for 3-coloring and 2-to-1 label cover.
with Per Austrin, Ryan O'Donnell, and John Wright.
ACM Transactions on Computation Theory 6(1), Article 2, (2014).
Analysis of Boolean functions.
Attribute-efficient learning and weight-degree tradeoffs for
with Rocco Servedio and Justin Thaler.
On the distribution of the Fourier spectrum of LTFs.
with Ilias Diakonikolas, Ragesh Jaiswal, Rocco Servedio, and
- Bounding the average
sensitivity and noise sensitivity of PTFs.
with Ilias Diakonikolas, Prasad Raghavendra, and Rocco
STOC 2010, merged with [Harsha-Klivans-Meka
SIAM Journal on Computuing 43(1), pp. 231-253, (2014).
A regularity lemma, and low-weight approximators, for low-degree PTFs.
with Ilias Diakonikolas, Rocco Servedio, and Andrew
Theory of Computing 10(2), pp. 27-53, (2014).
- The meta-theory of Q0 in the calculus of inductive
M.Sc. Thesis, 2006.
- The algebra of equality proofs.
with Aaron Stump.