| 2025 | COLT | Robust Algorithms for Recovering Planted r-Colorable Graphs. | Anand Louis, Rameesh Paul, Prasad Raghavendra |
| 2025 | FOCS | On optimal distinguishers for Planted Clique. | Ansh Nagda, Prasad Raghavendra |
| 2024 | COLT | Omnipredictors for regression and the approximate rank of convex functions. | Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Sherry, Mihir Singhal |
| 2024 | FOCS | Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold. | Venkatesan Guruswami, Jun-Ting Hsieh, Prasad Raghavendra |
| 2024 | FOCS | Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains. | Kuikui Liu, Sidhanth Mohanty, Prasad Raghavendra, Amit Rajaraman, David X. Wu |
| 2024 | STOC | Robust Recovery for Stochastic Block Models, Simplified and Generalized. | Sidhanth Mohanty, Prasad Raghavendra, David X. Wu |
| 2023 | STOC | Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion. | Ronen Eldan, Dan Mikulincer, Prasad Raghavendra |
| 2022 | STOC | Matrix discrepancy from Quantum communication. | Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty |
| 2021 | FOCS | On statistical inference when fixed points of belief propagation are unstable. | Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra |
| 2021 | SODA | Local Statistics, Semidefinite Programming, and Community Detection. | Jess Banks, Sidhanth Mohanty, Prasad Raghavendra |
| 2020 | COLT | List Decodable Subspace Recovery. | Prasad Raghavendra, Morris Yau |
| 2020 | SODA | Extended Formulation Lower Bounds for Refuting Random CSPs. | Jonah Brown-Cohen, Prasad Raghavendra |
| 2020 | SODA | List Decodable Learning via Sum of Squares. | Prasad Raghavendra, Morris Yau |
| 2020 | STOC | Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond. | Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni |
| 2020 | STOC | Lifting sum-of-squares lower bounds: degree-2 to degree-4. | Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu |
| 2019 | SODA | Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones. | Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz |
| 2018 | ESA | Average Whenever You Meet: Opportunistic Protocols for Community Detection. | Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan |
| 2017 | FOCS | The Power of Sum-of-Squares for Detecting Hidden Structures. | Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer |
| 2017 | ICALP | A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. | Pasin Manurangsi, Prasad Raghavendra |
| 2017 | ICALP | On the Bit Complexity of Sum-of-Squares Proofs. | Prasad Raghavendra, Benjamin Weitz |
| 2017 | STOC | Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. | Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra |
| 2017 | STOC | Strongly refuting random CSPs below the spectral threshold. | Prasad Raghavendra, Satish Rao, Tselil Schramm |
| 2016 | ICALP | Correlation Decay and Tractability of CSPs. | Jonah Brown-Cohen, Prasad Raghavendra |
| 2016 | SODA | The matching problem has no small symmetric SDP. | Gbor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink |
| 2016 | SODA | On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. | Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm |
| 2015 | STOC | Lower Bounds on the Size of Semidefinite Programming Relaxations. | James R. Lee, Prasad Raghavendra, David Steurer |
| 2014 | COLT | Computational Limits for Matrix Completion. | Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz |
| 2013 | FOCS | Approximate Constraint Satisfaction Requires Large LP Relaxations. | Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer |
| 2013 | FOCS | The Complexity of Approximating Vertex Expansion. | Anand Louis, Prasad Raghavendra, Santosh S. Vempala |
| 2012 | FOCS | Making the Long Code Shorter. | Boaz Barak, Parikshit Gopalan, Johan Hstad, Raghu Meka, Prasad Raghavendra, David Steurer |
| 2012 | SODA | Testing odd-cycle-freeness in Boolean functions. | Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira |
| 2012 | SODA | Bypassing UGC from some optimal geometric inapproximability results. | Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu |
| 2012 | SODA | Approximating CSPs with global cardinality constraints using SDP hierarchies. | Prasad Raghavendra, Ning Tan |
| 2012 | STOC | Many sparse cuts via higher eigenvalues. | Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala |
| 2011 | FOCS | Rounding Semidefinite Programming Hierarchies via Global Correlation. | Boaz Barak, Prasad Raghavendra, David Steurer |
| 2011 | MFCS | Generic Techniques to Round SDP Relaxations. | Prasad Raghavendra |
| 2010 | STOC | Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. | Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan |
| 2010 | STOC | Graph expansion and the unique games conjecture. | Prasad Raghavendra, David Steurer |
| 2010 | STOC | Approximations for the isoperimetric and spectral profile of graphs and related parameters. | Prasad Raghavendra, David Steurer, Prasad Tetali |
| 2009 | FOCS | Agnostic Learning of Monomials by Halfspaces Is Hard. | Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu |
| 2009 | FOCS | Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. | Prasad Raghavendra, David Steurer |
| 2009 | FOCS | How to Round Any CSP. | Prasad Raghavendra, David Steurer |
| 2009 | SODA | Towards computing the Grothendieck constant. | Prasad Raghavendra, David Steurer |
| 2009 | STOC | List decoding tensor products and interleaved codes. | Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra |
| 2009 | SPAA | Buffer management for colored packets with deadlines. | Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra |
| 2008 | FOCS | Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. | Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra |
| 2008 | STOC | Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. | Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz |
| 2008 | STOC | Optimal algorithms and inapproximability results for every CSP? | Prasad Raghavendra |
| 2007 | ACISP | On Proactive Perfectly Secure Message Transmission. | Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan |
| 2007 | STOC | A 3-query PCP over integers. | Venkatesan Guruswami, Prasad Raghavendra |
| 2006 | FOCS | Hardness of Learning Halfspaces with Noise. | Venkatesan Guruswami, Prasad Raghavendra |