| The Implicit Graph Conjecture is False. | 0 | 0.34 | 2022 |
| XOR lemmas for resilient functions against polynomials | 0 | 0.34 | 2020 |
| Higher-order Fourier Analysis and Applications. | 0 | 0.34 | 2019 |
| Pseudorandom Generators from Polarizing Random Walks | 0 | 0.34 | 2019 |
| Pseudorandom generators from the second Fourier level and applications to AC0 with parity gates. | 0 | 0.34 | 2019 |
| Biasing Boolean Functions and Collective Coin-Flipping Protocols over Arbitrary Product Distributions. | 0 | 0.34 | 2019 |
| Log-Seed Pseudorandom Generators via Iterated Restrictions. | 0 | 0.34 | 2019 |
| Improved Pseudorandomness for Unordered Branching Programs through Local Monotonicity. | 1 | 0.35 | 2018 |
| Near-Optimal Pseudorandom Generators for Constant-Depth Read-Once Formulas. | 0 | 0.34 | 2018 |
| On Multilinear Forms: Bias, Correlation, and Tensor Rank. | 0 | 0.34 | 2018 |
| Tight Bound on the Number of Relevant Variables in a Bounded degree Boolean function. | 1 | 0.43 | 2018 |
| Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius. | 0 | 0.34 | 2018 |
| Pseudorandom Generators for Low Sensitivity Functions. | 0 | 0.34 | 2018 |
| Pseudorandom Generators for Low-Sensitivity Functions. | 0 | 0.34 | 2017 |
| On the Structure of Quintic Polynomials | 0 | 0.34 | 2016 |
| A characterization of functions with vanishing averages over products of disjoint sets | 1 | 0.36 | 2016 |
| General systems of linear forms: Equidistribution and true complexity | 0 | 0.34 | 2014 |
| Algorithmic regularity for polynomials and applications | 7 | 0.61 | 2013 |
| An Arithmetic Analogue of Fox's Triangle Removal Argument | 2 | 0.39 | 2013 |
| Every locally characterized affine-invariant property is testable | 16 | 0.68 | 2012 |
| Lower Bounds on Testing Functions of Low Fourier Degree | 0 | 0.34 | 2012 |
| On Minimum Vertex Covers Of Generalized Petersen Graphs | 2 | 0.51 | 2010 |
| Variations on the Sensitivity Conjecture | 24 | 1.20 | 2010 |
| Measure preserving homomorphisms and independent sets in tensor graph powers | 0 | 0.34 | 2009 |
| A lower bound for the length of a partial transversal in a Latin square | 34 | 3.46 | 2008 |
| Perfect Dominating Sets in the Cartesian Products of Prime Cycles | 3 | 0.56 | 2007 |
| An approximation algorithm for the total cover problem | 3 | 0.44 | 2007 |
