- Theory of Unconditional Pseudorandom Generatorseccc, TR23, 2023. [doi]

- Fooling Constant-Depth Threshold Circuitseccc, 28:2, 2021. [doi]

- Pseudorandom Generators from the Second Fourier Level and Applications to AC0 with Parity Gatesinnovations 2018: [doi]
- XOR Lemmas for Resilient Functions Against Polynomialseccc, 26:145, 2019. [doi]
- Pseudorandom Generators from Polarizing Random Walkstoc, 15:1-26, 2019. [doi]
- Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributionsicalp 2019: [doi]
- Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributionseccc, 26:29, 2019. [doi]
- Higher-order Fourier Analysis and Applicationsfttcs, 13(4):247-448, 2019. [doi]

- Limits of Boolean Functions on $\mathbb{F}_p^n$combinatorics, 21(4):4, 2014. [doi]

- Variations on the Sensitivity Conjecturetoc, 2:1-27, 2011. [doi]

- On the signed edge domination number of graphsDM, 309(3):587-594, 2009. [doi]
- Measure preserving homomorphisms and independent sets in tensor graph powersDM, 309(4):955-958, 2009. [doi]

- On minimum vertex covers of generalized Petersen graphsajc, 40:253-264, 2008. [doi]
- A lower bound for the length of a partial transversal in a Latin squareJCT, 115(7):1103-1113, 2008. [doi]

- An approximation algorithm for the total covering problemdmgt, 27(3):553-558, 2007. [doi]