On Proactive Perfectly Secure Message Transmission. - Kannan Srinathan; Prasad Raghavendra; C. Pandu Rangan (ACISP, 2007)

A 3-query PCP over integers. - Venkatesan Guruswami; Prasad Raghavendra (STOC, 2007)

A Note on Yekhanin's Locally Decodable Codes. - Prasad Raghavendra (Electron. Colloquium Comput. Complex., 2007)

Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. - Venkatesan Guruswami; Rajsekar Manokaran; Prasad Raghavendra (FOCS, 2008)

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. - Rajsekar Manokaran; Joseph Naor; Prasad Raghavendra; Roy Schwartz 002 (STOC, 2008)

Optimal algorithms and inapproximability results for every CSP? - Prasad Raghavendra (STOC, 2008)

Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. - Venkatesan Guruswami; Prasad Raghavendra (Electron. Colloquium Comput. Complex., 2008)

Coarse Differentiation and Multi-flows in Planar Graphs. - James R. Lee; Prasad Raghavendra (Electron. Colloquium Comput. Complex., 2008)

On the Communication Complexity of Read-Once AC^0 Formulae. - T. S. Jayram; Swastik Kopparty; Prasad Raghavendra (CCC, 2009)

Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. - Prasad Raghavendra; David Steurer (FOCS, 2009)

How to Round Any CSP. - Prasad Raghavendra; David Steurer (FOCS, 2009)

Towards computing the Grothendieck constant. - Prasad Raghavendra; David Steurer (SODA, 2009)

Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. - Venkatesan Guruswami; Prasad Raghavendra (Electron. Colloquium Comput. Complex., 2009)

Perfectly reliable and secure message transmission tolerating mobile adversary. - Arpita Patra; Ashish Choudhary; C. Pandu Rangan; Kannan Srinathan; Prasad Raghavendra (Int. J. Appl. Cryptogr., 2009)

Hardness of Learning Halfspaces with Noise. - Venkatesan Guruswami; Prasad Raghavendra (SIAM J. Comput., 2009)

Approximating Sparsest Cut in Graphs of Bounded Treewidth. - Eden Chlamtac; Robert Krauthgamer; Prasad Raghavendra (APPROX-RANDOM, 2010)

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 (STOC, 2010)

Graph expansion and the unique games conjecture. - Prasad Raghavendra; David Steurer (STOC, 2010)

Approximations for the isoperimetric and spectral profile of graphs and related parameters. - Prasad Raghavendra; David Steurer; Prasad Tetali (STOC, 2010)

Bypassing UGC from some optimal geometric inapproximability results. - Venkatesan Guruswami; Prasad Raghavendra; Rishi Saket; Yi Wu 002 (Electron. Colloquium Comput. Complex., 2010)

Reductions Between Expansion Problems. - Prasad Raghavendra; David Steurer; Madhur Tulsiani (Electron. Colloquium Comput. Complex., 2010)

Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. - Anand Louis; Prasad Raghavendra; Prasad Tetali; Santosh S. Vempala (APPROX-RANDOM, 2011)

Finding Almost-Perfect Graph Bisections. - Venkatesan Guruswami; Yury Makarychev; Prasad Raghavendra; David Steurer; Yuan Zhou 007 (ICS, 2011)

Generic Techniques to Round SDP Relaxations. - Prasad Raghavendra (MFCS, 2011)

Making the long code shorter, with applications to the Unique Games Conjecture. - Boaz Barak; Parikshit Gopalan; Johan Håstad; Raghu Meka; Prasad Raghavendra; David Steurer (Electron. Colloquium Comput. Complex., 2011)

Rounding Semidefinite Programming Hierarchies via Global Correlation. - Boaz Barak; Prasad Raghavendra; David Steurer (Electron. Colloquium Comput. Complex., 2011)

Testing Odd-Cycle-Freeness in Boolean Functions. - Arnab Bhattacharyya 001; Elena Grigorescu; Prasad Raghavendra; Asaf Shapira (Electron. Colloquium Comput. Complex., 2011)

Buffer Management for Colored Packets with Deadlines. - Yossi Azar; Uriel Feige; Iftah Gamzu; Thomas Moscibroda; Prasad Raghavendra (Theory Comput. Syst., 2011)

List Decoding Tensor Products and Interleaved Codes. - Parikshit Gopalan; Venkatesan Guruswami; Prasad Raghavendra (SIAM J. Comput., 2011)

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. - Venkatesan Guruswami; Johan Håstad; Rajsekar Manokaran; Prasad Raghavendra; Moses Charikar (SIAM J. Comput., 2011)

Approximating CSPs with global cardinality constraints using SDP hierarchies. - Prasad Raghavendra; Ning Tan 002 (SODA, 2012)

Many sparse cuts via higher eigenvalues. - Anand Louis; Prasad Raghavendra; Prasad Tetali; Santosh S. Vempala (STOC, 2012)

On Mimicking Networks Representing Minimum Terminal Cuts - Arindam Khan 001; Prasad Raghavendra; Prasad Tetali; László A. Végh (CoRR, 2012)

Agnostic Learning of Monomials by Halfspaces Is Hard. - Vitaly Feldman; Venkatesan Guruswami; Prasad Raghavendra; Yi Wu 002 (SIAM J. Comput., 2012)

The Complexity of Approximating Vertex Expansion. - Anand Louis; Prasad Raghavendra; Santosh S. Vempala (FOCS, 2013)

Improved Approximation Algorithms for the Spanning Star Forest Problem. - Ning Chen 005; Roee Engelberg; C. Thach Nguyen; Prasad Raghavendra; Atri Rudra; Gyanit Singh (Algorithmica, 2013)

Foreword to the Special Issue on SODA'11. - Shuchi Chawla 001; Prasad Raghavendra; Dana Randall (ACM Trans. Algorithms, 2013)

Gap Amplification for Small-Set Expansion via Random Walks. - Prasad Raghavendra; Tselil Schramm (APPROX-RANDOM, 2014)

On the Power of Symmetric LP and SDP Relaxations. - James R. Lee; Prasad Raghavendra; David Steurer; Ning Tan 002 (CCC, 2014)

Computational Limits for Matrix Completion. - Moritz Hardt; Raghu Meka; Prasad Raghavendra; Benjamin Weitz (COLT, 2014)

On mimicking networks representing minimum terminal cuts. - Arindam Khan 001; Prasad Raghavendra (Inf. Process. Lett., 2014)

Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions. - Ilias Diakonikolas; Prasad Raghavendra; Rocco A. Servedio; Li-Yang Tan (SIAM J. Comput., 2014)

Lower Bounds on the Size of Semidefinite Programming Relaxations. - James R. Lee; Prasad Raghavendra; David Steurer (STOC, 2015)

Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program. - Prasad Raghavendra; Tselil Schramm (CoRR, 2015)

Beating the random assignment on constraint satisfaction problems of bounded degree. - Boaz Barak; Ankur Moitra; Ryan O'Donnell; Prasad Raghavendra; Oded Regev 001; David Steurer; Luca Trevisan 001; Aravindan Vijayaraghavan; David Witmer; John Wright 004 (Electron. Colloquium Comput. Complex., 2015)

Combinatorial Optimization Algorithms via Polymorphisms. - Jonah Brown-Cohen; Prasad Raghavendra (Electron. Colloquium Comput. Complex., 2015)

Making the Long Code Shorter. - Boaz Barak; Parikshit Gopalan; Johan Håstad; Raghu Meka; Prasad Raghavendra; David Steurer (SIAM J. Comput., 2015)

Correlation Decay and Tractability of CSPs. - Jonah Brown-Cohen; Prasad Raghavendra (ICALP, 2016)

Approximate Constraint Satisfaction Requires Large LP Relaxations. - Siu On Chan; James R. Lee; Prasad Raghavendra; David Steurer (J. ACM, 2016)

The Power of Sum-of-Squares for Detecting Hidden Structures. - Samuel B. Hopkins 001; Pravesh K. Kothari; Aaron Potechin; Prasad Raghavendra; Tselil Schramm; David Steurer (FOCS, 2017)

A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. - Pasin Manurangsi; Prasad Raghavendra (ICALP, 2017)

On the Bit Complexity of Sum-of-Squares Proofs. - Prasad Raghavendra; Benjamin Weitz (ICALP, 2017)

Real Stability Testing. - Prasad Raghavendra; Nick Ryder; Nikhil Srivastava (ITCS, 2017)

Strongly refuting random CSPs below the spectral threshold. - Prasad Raghavendra; Satish Rao; Tselil Schramm (STOC, 2017)

Friend or Foe? Population Protocols can perform Community Detection. - Luca Becchetti; Andrea Clementi; Emanuele Natale; Francesco Pasquale; Prasad Raghavendra; Luca Trevisan 001 (CoRR, 2017)

Dimension Reduction for Polynomials over Gaussian Space and Applications. - Badih Ghazi; Pritish Kamath; Prasad Raghavendra (Electron. Colloquium Comput. Complex., 2017)

The matching problem has no small symmetric SDP. - Gábor Braun; Jonah Brown-Cohen; Arefin Huq; Sebastian Pokutta; Prasad Raghavendra; Aurko Roy; Benjamin Weitz; Daniel Zink (Math. Program., 2017)

Average Whenever You Meet: Opportunistic Protocols for Community Detection. - Luca Becchetti; Andrea Clementi; Pasin Manurangsi; Emanuele Natale; Francesco Pasquale; Prasad Raghavendra; Luca Trevisan 001 (ESA, 2018)

High-dimensional estimation via sum-of-squares proofs. - Prasad Raghavendra; Tselil Schramm; David Steurer (CoRR, 2018)

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. - Samuel B. Hopkins 001; Pravesh Kothari; Aaron Henry Potechin; Prasad Raghavendra; Tselil Schramm (ACM Trans. Algorithms, 2018)

Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones. - Prasad Raghavendra; Nick Ryder; Nikhil Srivastava; Benjamin Weitz (SODA, 2019)

List Decodable Subspace Recovery. - Prasad Raghavendra; Morris Yau (COLT, 2020)

Extended Formulation Lower Bounds for Refuting Random CSPs. - Jonah Brown-Cohen; Prasad Raghavendra (SODA, 2020)

List Decodable Learning via Sum of Squares. - Prasad Raghavendra; Morris Yau (SODA, 2020)

Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond. - Yeshwanth Cherapanamjeri; Samuel B. Hopkins 001; Tarun Kathuria; Prasad Raghavendra; Nilesh Tripuraneni (STOC, 2020)

Lifting sum-of-squares lower bounds: degree-2 to degree-4. - Sidhanth Mohanty; Prasad Raghavendra; Jeff Xu (STOC, 2020)

On statistical inference when fixed points of belief propagation are unstable. - Siqi Liu 005; Sidhanth Mohanty; Prasad Raghavendra (FOCS, 2021)

Local Statistics, Semidefinite Programming, and Community Detection. - Jess Banks; Sidhanth Mohanty; Prasad Raghavendra (SODA, 2021)

Computational phase transitions in sparse planted problems? - Siqi Liu 005; Sidhanth Mohanty; Prasad Raghavendra (CoRR, 2021)

Matrix discrepancy from Quantum communication. - Samuel B. Hopkins 001; Prasad Raghavendra; Abhishek Shetty (STOC, 2022)

Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs. - Pravesh K. Kothari; Raghu Meka; Prasad Raghavendra (SIAM J. Comput., 2022)

On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk). - Prasad Raghavendra (FSTTCS, 2023)

Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion. - Ronen Eldan; Dan Mikulincer; Prasad Raghavendra (STOC, 2023)

Omnipredictors for regression and the approximate rank of convex functions. - Parikshit Gopalan; Princewill Okoroafor; Prasad Raghavendra; Abhishek Sherry; Mihir Singhal (COLT, 2024)

Certifying Euclidean Sections and Finding Planted Sparse Vectors Beyond the √n Dimension Threshold. - Venkatesan Guruswami; Jun-Ting Hsieh; Prasad Raghavendra (FOCS, 2024)

Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains. - Kuikui Liu; Sidhanth Mohanty; Prasad Raghavendra; Amit Rajaraman; David X. Wu (FOCS, 2024)

Robust Recovery for Stochastic Block Models, Simplified and Generalized. - Sidhanth Mohanty; Prasad Raghavendra; David X. Wu (STOC, 2024)

Omnipredictors for Regression and the Approximate Rank of Convex Functions. - Parikshit Gopalan; Princewill Okoroafor; Prasad Raghavendra; Abhishek Shetty; Mihir Singhal (CoRR, 2024)

Robust Algorithms for Recovering Planted r-Colorable Graphs. - Anand Louis; Rameesh Paul; Prasad Raghavendra (COLT, 2025)

On optimal distinguishers for Planted Clique. - Ansh Nagda; Prasad Raghavendra (CoRR, 2025)