| A Characterization of Multiclass Learnability | 0 | 0.34 | 2022 |
| Explicit SoS lower bounds from high-dimensional expanders | 0 | 0.34 | 2021 |
| List-Decoding With Double Samplers | 0 | 0.34 | 2021 |
| From Local to Robust Testing via Agreement Testing. | 0 | 0.34 | 2019 |
| Every set in P is strongly testable under a suitable encoding. | 0 | 0.34 | 2019 |
| Testing tensor products. | 0 | 0.34 | 2019 |
| Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests - [Extended abstract]. | 1 | 0.37 | 2019 |
| Near Coverings and Cosystolic Expansion - an example of topological property testing. | 0 | 0.34 | 2019 |
| Direct Sum Testing - The General Case. | 0 | 0.34 | 2019 |
| Agreement Testing Theorems on Layered Set Systems | 0 | 0.34 | 2019 |
| ETH-Hardness of Approximating 2-CSPs and Directed Steiner Network. | 1 | 0.36 | 2018 |
| Boolean Function Analysis on High-Dimensional Expanders. | 1 | 0.35 | 2018 |
| Boolean functions on high-dimensional expanders. | 0 | 0.34 | 2018 |
| On Non-Optimally Expanding Sets in Grassmann Graphs. | 7 | 0.54 | 2018 |
| Towards a Proof of the 2-to-1 Games Conjecture? | 8 | 0.61 | 2018 |
| List Decoding with Double Samplers. | 0 | 0.34 | 2018 |
| Exponentially Small Soundness for the Direct Product Z-test. | 1 | 0.37 | 2017 |
| High Dimensional Expanders Imply Agreement Expanders | 7 | 0.62 | 2017 |
| Agreement tests on graphs and hypergraphs. | 0 | 0.34 | 2017 |
| Low degree almost Boolean functions are sparse juntas. | 2 | 0.37 | 2017 |
| Toward the KRW Composition Conjecture: Cubic Formula Lower Bounds via Communication Complexity. | 1 | 0.35 | 2016 |
| Mildly exponential reduction from gap 3SAT to polynomial-gap label-cover. | 11 | 0.46 | 2016 |
| Multiplayer parallel repetition for expander games. | 0 | 0.34 | 2016 |
| Cube vs. Cube Low Degree Test. | 1 | 0.37 | 2016 |
| Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition | 3 | 0.40 | 2015 |
| A parallel repetition theorem for entangled projection games. | 16 | 0.89 | 2015 |
| Derandomized Graph Product Results Using the Low Degree Long Code. | 0 | 0.34 | 2014 |
| The Computational Benefit of Correlated Instances | 1 | 0.35 | 2014 |
| Covering CSPs. | 0 | 0.34 | 2013 |
| Composition of Low-Error 2-Query PCPs Using Decodable PCPs | 16 | 0.60 | 2013 |
| Analytical approach to parallel repetition | 107 | 3.59 | 2013 |
| PCPs via Low-Degree Long Code and Hardness for Constrained Hypergraph Coloring | 9 | 0.72 | 2013 |
| Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings | 83 | 3.78 | 2013 |
| On the Conditional Hardness of Coloring a 4-Colorable Graph with Super-Constant Number of Colors | 6 | 0.48 | 2013 |
| Direct Product Testing | 9 | 0.59 | 2013 |
| Special Issue "Conference on Computational Complexity 2012" Guest editors' foreword. | 0 | 0.34 | 2013 |
| Clustering in the boolean hypercube in a list decoding regime | 0 | 0.34 | 2013 |
| Derandomized Parallel Repetition via Structured PCPs | 16 | 0.74 | 2011 |
| PCP Characterizations of NP: Toward a Polynomially-Small Error-Probability | 30 | 2.26 | 2011 |
| Dense locally testable codes cannot have constant rate and distance | 4 | 0.40 | 2010 |
| Hardness of Finding Independent Sets in Almost 3-Colorable Graphs | 6 | 0.45 | 2010 |
| The structure of winning strategies in parallel repetition games | 2 | 0.36 | 2010 |
| Conditional Hardness for Approximate Coloring. | 3 | 0.40 | 2009 |
| Intersecting families are essentially contained in juntas | 16 | 1.37 | 2009 |
| PCPs with small soundness error | 3 | 0.42 | 2008 |
| Locally Testing Direct Product in the Low Error Range | 15 | 0.75 | 2008 |
| Decodability of group homomorphisms beyond the johnson bound | 5 | 0.43 | 2008 |
| Special Issue on Foundations of Computer Science | 0 | 0.34 | 2008 |
| Proof of an Intersection Theorem via Graph Homomorphisms | 3 | 0.60 | 2006 |
| Robust Local Testability of Tensor Products of LDPC Codes | 21 | 0.81 | 2006 |
