- Approximate Nonnegative Rank is Equivalent to the Smooth Rectangle Boundcc, 28(1):1-25, 2019. [doi]

- Distributed construction of purely additive spannersdc, 31(3):223-240, 2018. [doi]
- Anti-concentration in most directionseccc, 25:194, 2018. [doi]
- Separating Monotone VP and VNPeccc, 25:124, 2018. [doi]

- On Communication Complexity of Classification Problemseccc, 24:177, 2017. [doi]
- An Elementary Exposition of Topological Overlap in the Planedcg, 58(2):255-264, 2017. [doi]

- Direct Sum Fails for Zero-Error Average Communicationalgorithmica, 76(3):782-795, 2016. [doi]
- Sample Compression Schemes for VC ClassesJACM, 63(3):21, 2016. [doi]
- A Note on Average-Case Sortingorder, 33(1):23-28, 2016. [doi]
- On the Capacity of Evolution Strategies to Statistically Learn the Landscapegecco 2016: 151-152 [doi]
- Population recovery and partial identificationml, 102(1):29-56, 2016. [doi]
- Pointer chasing via triangular discriminationeccc, 23:151, 2016. [doi]

- On isoperimetric profiles and computational complexityeccc, 22:164, 2015. [doi]
- Proper PAC learning is compressingeccc, 22:40, 2015. [doi]
- Teaching and compressing for low VC-dimensioneccc, 22:25, 2015. [doi]

- Sign rank, VC dimension and spectral gapseccc, 21:135, 2014. [doi]
- Internal compression of protocols to entropyeccc, 21:101, 2014. [doi]
- Pseudorandom Generators for Regular Branching ProgramsSIAMCOMP, 43(3):973-986, 2014. [doi]

- Pseudorandomness for Width-2 Branching Programstoc, 9:283-293, 2013. [doi]
- Direct product via round-preserving compressioneccc, 20:35, 2013. [doi]
- Formulas are Exponentially Stronger than Monotone Circuits in Non-commutative Settingcoco 2013: 10-14 [doi]
- A note on average-case sortingeccc, 20:106, 2013. [doi]
- Lipschitz Functions on Expanders are Typically Flatcpc, 22(4):566-591, 2013. [doi]

- Monotone expansionstoc 2012: 1061-1078 [doi]
- Direct Products in Communication Complexityeccc, 19:143, 2012. [doi]
- Formulas are exponentially stronger than monotone circuits in non-commutative settingeccc, 19:61, 2012. [doi]
- Population Recovery and Partial Identificationeccc, 19:118, 2012. [doi]
- Proving expansion in three stepssigact, 43(3):67-84, 2012. [doi]

- Rank bounds for design matrices with applications toc ombinatorial geometry and locally correctable codesstoc 2011: 519-528 [doi]
- Separating multilinear branching programs and formulaseccc, 18:134, 2011. [doi]
- Restriction Accesseccc, 18:160, 2011. [doi]
- Arithmetic Complexity in Ring Extensionstoc, 7(1):119-129, 2011. [doi]
- Homogeneous Formulas and Symmetric Polynomialscc, 20(3):559-578, 2011. [doi]
- The maximal probability that ::::k::::-wise independent bits are all 1rsa, 38(4):502-525, 2011. [doi]
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractorsjcss, 77(1):167-190, 2011. [doi]
- Affine extractors over prime fieldscombinatorica, 31(2):245-256, 2011. [doi]

- Pseudorandomness for Width 2 Branching Programseccc, 16:70, 2009. [doi]
- Hardness-Randomness Tradeoffs for Bounded Depth Arithmetic CircuitsSIAMCOMP, 39(4):1279-1293, 2009. [doi]
- Players Effects Under Limited Independencemor, 34(4):971-980, 2009. [doi]
- Monotone separations for constant degree polynomialsipl, 110(1):1-3, 2009. [doi]
- Lower Bounds and Separations for Constant Depth Multilinear Circuitscc, 18(2):171-207, 2009. [doi]

- t-Wise independence with local dependenciesipl, 106(5):208-212, 2008. [doi]
- Multilinear Formulas, Maximal-Partition Discrepancy and Mixed-Sources Extractorsfocs 2008: 273-282 [doi]
- A Lower Bound for the Size of Syntactically Multilinear Arithmetic CircuitsSIAMCOMP, 38(4):1624-1647, 2008. [doi]
- Balancing Syntactically Multilinear Arithmetic Circuitscc, 17(4):515-535, 2008. [doi]