- UG-hardness to NP-hardness by Losing Halfeccc, 26:4, 2019. [doi]
- On Rich $2$-to-$1$ Gameseccc, 26:141, 2019. [doi]
- Improved 3LIN Hardness via Linear Label Covereccc, 26:93, 2019. [doi]

- On Monotonicity Testing and Boolean Isoperimetric-type TheoremsSIAMCOMP, 47(6):2238-2276, 2018. [doi]
- Small Set Expansion in The Johnson Grapheccc, 25:78, 2018. [doi]

- On Non-Optimally Expanding Sets in Grassmann Graphseccc, 24:94, 2017. [doi]
- Ã˜mega(1) ColorsSIAMCOMP, 46(1):235-271, 2017. [doi]

- Towards a Proof of the 2-to-1 Games Conjecture?eccc, 23:198, 2016. [doi]
- Approximating CSPs using LP Relaxationeccc, 23:116, 2016. [doi]

- A Simple Deterministic Reduction for the Gap Minimum Distance of Code ProblemTIT, 60(10):6636-6645, 2014. [doi]
- Hardness of Coloring $2$-Colorable $12$-Uniform Hypergraphs with $2^{(\log n)^{\Omega(1)}}$ Colorseccc, 21:51, 2014. [doi]
- Hardness of Finding Independent Sets in 2-Colorable and Almost 2-Colorable Hypergraphssoda 2014: 1607-1625 [doi]
- Hardness of Coloring 2-Colorable 12-Uniform Hypergraphs with exp(log^{Omega(1)} n) Colorsfocs 2014: 206-215 [doi]
- Candidate Lasserre Integrality Gap For Unique Gameseccc, 21:142, 2014. [doi]
- Almost Polynomial Factor Hardness for Closest Vector Problem with PreprocessingSIAMCOMP, 43(3):1184-1205, 2014. [doi]

- A characterization of approximation resistance for even k-partite CSPsinnovations 2013: 187-196 [doi]
- A Two-Prover One-Round Game with Strong Soundnesstoc, 9:863-887, 2013. [doi]
- A Characterization of Approximation Resistanceeccc, 20:146, 2013. [doi]
- Sharp kernel clustering algorithms and their associated Grothendieck inequalitiesrsa, 42(3):269-300, 2013. [doi]
- NP-Hardness of Approximately Solving Linear Equations over RealsSIAMCOMP, 42(3):752-791, 2013. [doi]

- Towards An Optimal Query Efficient PCP?eccc, 19:109, 2012. [doi]

- Hardness of Approximating the Closest Vector Problem with Pre-Processingcc, 20(4):741-753, 2011. [doi]
- Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphstoc, 7(1):27-43, 2011. [doi]
- A Simple Deterministic Reduction for the Gap Minimum Distance of Code Problemicalp 2011: 474-485 [doi]
- Combinatorial theorems about embedding trees on the real linejgt, 67(2):153-168, 2011. [doi]
- On the hardness of learning intersections of two halfspacesjcss, 77(1):129-141, 2011. [doi]

- Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problemsicalp 2010: 250-261 [doi]
- Hardness of Reconstructing Multivariate Polynomials over Finite FieldsSIAMCOMP, 39(6):2598-2621, 2010. [doi]
- Inapproximability Results for Computational Problems on LatticesIn Phong Q. Nguyen, Brigitte VallÃ©e, editors, The LLL Algorithm - Survey and Applications. Information Security and Cryptography, pages 453-473, Springer, 2010. [doi]

- Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphscoco 2009: 74-80 [doi]
- On Agnostic Learning of Parities, Monomials, and HalfspacesSIAMCOMP, 39(2):606-645, 2009. [doi]
- On Earthmover Distance, Metric Labeling, and 0-ExtensionSIAMCOMP, 39(2):371-387, 2009. [doi]
- SDP Gaps and UGC-hardness for Max-Cut-Gaintoc, 5(1):83-117, 2009. [doi]

- Linear Equations Modulo 2 and the L::1:: Diameter of Convex BodiesSIAMCOMP, 38(4):1448-1463, 2008. [doi]
- Vertex cover might be hard to approximate to within 2-epsilonjcss, 74(3):335-349, 2008. [doi]

- Improved lower bounds on the randomized complexity of graph propertiesrsa, 30(3):427-440, 2007. [doi]
- Optimal Inapproximability Results for MAX-CUT and Other 2-Variable CSPs?SIAMCOMP, 37(1):319-357, 2007. [doi]

- Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite CliqueSIAMCOMP, 36(4):1025-1071, 2006. [doi]
- Hardness of approximating the Shortest Vector Problem in high ::::l::p:::::: normsjcss, 72(2):206-219, 2006. [doi]