| Explicit SoS lower bounds from high-dimensional expanders | 0 | 0.34 | 2021 |
| Sum-of-Squares Lower Bounds for Sparse Independent Set | 1 | 0.35 | 2021 |
| Near-linear time decoding of Ta-Shma’s codes via splittable regularity | 0 | 0.34 | 2021 |
| List Decoding of Direct Sum Codes. | 0 | 0.34 | 2020 |
| Unique Decoding of Explicit <tex>$\varepsilon$</tex>-balanced Codes Near the Gilbert-Varshamov Bound | 0 | 0.34 | 2020 |
| Approximability of p → q Matrix Norms - Generalized Krivine Rounding and Hypercontractive Hardness. | 0 | 0.34 | 2019 |
| Approximating Operator Norms via Generalized Krivine Rounding. | 0 | 0.34 | 2018 |
| Inapproximability of Matrix p→q Norms. | 1 | 0.35 | 2018 |
| From Weak to Strong Linear Programming Gaps for All Constraint Satisfaction Problems. | 0 | 0.34 | 2018 |
| Approximate Local Decoding of Cubic Reed-Muller Codes Beyond the List Decoding Radius. | 0 | 0.34 | 2018 |
| Inapproximability of Matrix $p \rightarrow q$ Norms. | 0 | 0.34 | 2018 |
| Finding Pseudorandom Colorings of Pseudorandom Graphs. | 0 | 0.34 | 2017 |
| Multiplicative Approximations for Polynomial Optimization Over the Unit Sphere. | 0 | 0.34 | 2016 |
| From Weak to Strong LP Gaps for all CSPs. | 1 | 0.35 | 2016 |
| Proving Weak Approximability Without Algorithms. | 0 | 0.34 | 2016 |
| Optimal Strong Parallel Repetition for Projection Games on Low Threshold Rank Graphs. | 0 | 0.34 | 2014 |
| Linear Programming Hierarchies Suffice for Directed Steiner Tree. | 3 | 0.41 | 2014 |
| LS+ Lower Bounds from Pairwise Independence. | 4 | 0.43 | 2013 |
| Algorithmic regularity for polynomials and applications | 7 | 0.61 | 2013 |
| An Arithmetic Analogue of Fox's Triangle Removal Argument | 2 | 0.39 | 2013 |
| A Characterization of Approximation Resistance. | 2 | 0.40 | 2013 |
| SDP Gaps from Pairwise Independence. | 22 | 0.88 | 2012 |
| Sampling-Based Proofs of Almost-Periodicity Results and Algorithmic Applications. | 1 | 0.35 | 2012 |
| Graph densification | 2 | 0.39 | 2012 |
| The Complexity of Somewhat Approximation Resistant Predicates. | 0 | 0.34 | 2012 |
| Towards an optimal query efficient PCP? | 0 | 0.34 | 2012 |
| Cuts in Cartesian Products of Graphs | 3 | 0.53 | 2011 |
| On LP-based approximability for strict CSPs | 13 | 0.68 | 2011 |
| Quadratic Goldreich-Levin Theorems | 4 | 0.41 | 2011 |
| Reductions between Expansion Problems | 45 | 1.43 | 2010 |
| Time space tradeoffs for attacks against one-way functions and PRGs | 18 | 0.70 | 2010 |
| SDP gaps for 2-to-1 and other label-cover variants | 2 | 0.37 | 2010 |
| On the Optimality of a Class of LP-based Algorithms | 2 | 0.38 | 2009 |
| Optimal Sherali-Adams Gaps from Pairwise Independence | 1 | 0.35 | 2009 |
| Algorithms and Hardness for Subspace Approximation | 18 | 0.91 | 2009 |
| CSP gaps and reductions in the lasserre hierarchy | 70 | 1.86 | 2009 |
| Non-uniform attacks against one-way functions and PRGs | 8 | 0.54 | 2009 |
| Dense Subsets of Pseudorandom Sets | 28 | 1.47 | 2008 |
| Regularity, Boosting, and Efficiently Simulating Every High-Entropy Distribution | 24 | 1.11 | 2008 |
| Unique games on expanding constraint graphs are easy: extended abstract | 30 | 1.37 | 2008 |
| Tight integrality gaps for Lovasz-Schrijver LP relaxations of vertex cover and max cut | 29 | 1.31 | 2007 |
| A Linear Round Lower Bound for Lovasz-Schrijver SDP Relaxations of Vertex Cover | 17 | 1.20 | 2007 |
