P. Raghavendra

发表

Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond

Prasad Raghavendra, Samuel B. Hopkins, Yeshwanth Cherapanamjeri, 2019, STOC.

Computational Limits for Matrix Completion

Prasad Raghavendra, Benjamin Weitz, Raghu Meka, 2014, COLT.

Agnostic Learning of Monomials by Halfspaces Is Hard

Prasad Raghavendra, Venkatesan Guruswami, Vitaly Feldman, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

High-dimensional estimation via sum-of-squares proofs pdf

Prasad Raghavendra, Tselil Schramm, David Steurer, 2018, Proceedings of the International Congress of Mathematicians (ICM 2018).

Approximating np-hard problems efficient algorithms and their limits

P. Raghavendra, V. Guruswami, 2009 .

Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling

Prasad Raghavendra, Joseph Naor, Roy Schwartz, 2008, STOC.

Integrality Gaps for Strong SDP Relaxations of U G

P. Raghavendra, 2009 .

Increasing the Span of Stars

C. T. Nguyen, A. Rudra, P. Raghavendra, 2007 .

DECODING TENSOR PRODUCTS AND INTERLEAVED CODES

P. Gopalan, P. Raghavendra, V. Guruswami, 2008 .

Finding Sparse Cuts via Cheeger Inequalities for Higher Eigenvalues

S. Vempala, P. Tetali, P. Raghavendra, 2012 .

Noise stability on the Boolean hypercube via a renormalized Brownian motion

Ronen Eldan, P. Raghavendra, Dan Mikulincer, 2022, ArXiv.

The matching problem has no small symmetric SDP

Aurko Roy, P. Raghavendra, Jonah Brown-Cohen, 2016, Mathematical Programming.

Generic Techniques to Round SDP Relaxations

Prasad Raghavendra, P. Raghavendra, 2011, MFCS.

Component Test Specification Based on the Karhunen-Loeve Expansion.

Prasad Raghavendra, Thomas Lee Paez, P. Raghavendra, 2007 .

The Power of Sum-of-Squares for Detecting Hidden Structures

Prasad Raghavendra, Pravesh Kothari, Tselil Schramm, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

Strongly refuting random CSPs below the spectral threshold

Prasad Raghavendra, Tselil Schramm, Satish Rao, 2016, STOC.

Many sparse cuts via higher eigenvalues

Prasad Raghavendra, Santosh S. Vempala, Prasad Tetali, 2011, STOC '12.

Approximate Constraint Satisfaction Requires Large LP Relaxations

Prasad Raghavendra, James R. Lee, David Steurer, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Lower Bounds on the Size of Semidefinite Programming Relaxations

Prasad Raghavendra, James R. Lee, David Steurer, 2014, STOC.

Graph expansion and the unique games conjecture

Prasad Raghavendra, David Steurer, David Steurer, 2010, STOC '10.

Optimal algorithms and inapproximability results for every CSP?

Prasad Raghavendra, P. Raghavendra, 2008, STOC.

Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions

Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan, 2009, SIAM J. Comput..

List Decodable Learning via Sum of Squares

Prasad Raghavendra, Morris Yau, P. Raghavendra, 2019, SODA.

Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant

Prasad Raghavendra, Venkatesan Guruswami, Johan Håstad, 2011, SIAM J. Comput..

Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph

Prasad Raghavendra, Venkatesan Guruswami, Rajsekar Manokaran, 2008, 2008 49th Annual IEEE Symposium on Foundations of Computer Science.

Beating the random assignment on constraint satisfaction problems of bounded degree pdf

Prasad Raghavendra, Luca Trevisan, Ankur Moitra, 2015, Electron. Colloquium Comput. Complex..

Local Statistics, Semidefinite Programming, and Community Detection pdf

P. Raghavendra, Jessica E. Banks, Sidhanth Mohanty, 2019, SODA.

Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs

Prasad Raghavendra, Pravesh Kothari, Raghu Meka, 2016, STOC.

Friend or Foe? Population Protocols can perform Community Detection pdf

Prasad Raghavendra, Luca Trevisan, Andrea E. F. Clementi, 2017, ArXiv.

Approximations for the isoperimetric and spectral profile of graphs and related parameters

Prasad Raghavendra, David Steurer, Prasad Tetali, 2010, STOC '10.

The matching problem has no small symmetric SDP

Prasad Raghavendra, Aurko Roy, Sebastian Pokutta, 2015, Math. Program..

Matrix discrepancy from Quantum communication pdf

Prasad Raghavendra, Samuel B. Hopkins, Abhishek Shetty, 2021, STOC.

Towards computing the Grothendieck constant

Prasad Raghavendra, David Steurer, David Steurer, 2009, SODA.

Lifting sum-of-squares lower bounds: degree-2 to degree-4

Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu, 2019, STOC.

A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs

Prasad Raghavendra, Pasin Manurangsi, P. Raghavendra, 2016, ICALP.

Correlation Decay and Tractability of CSPs

Prasad Raghavendra, Jonah Brown-Cohen, P. Raghavendra, 2016, ICALP.

A Note on Yekhanin's Locally Decodable Codes

Prasad Raghavendra, P. Raghavendra, 2007, Electron. Colloquium Comput. Complex..

Real Stability Testing pdf

Prasad Raghavendra, Nikhil Srivastava, Nick Ryder, 2016, ITCS.

Exponential lower bounds on spectrahedral representations of hyperbolicity cones pdf

Prasad Raghavendra, Nikhil Srivastava, Benjamin Weitz, 2017, SODA.

Hardness of Learning Halfspaces with Noise

Prasad Raghavendra, Venkatesan Guruswami, P. Raghavendra, 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

On the Bit Complexity of Sum-of-Squares Proofs pdf

Prasad Raghavendra, Benjamin Weitz, P. Raghavendra, 2017, ICALP.

Average Whenever You Meet: Opportunistic Protocols for Community Detection

Prasad Raghavendra, Luca Trevisan, Andrea E. F. Clementi, 2017, ESA.

List Decodable Subspace Recovery pdf

Prasad Raghavendra, Morris Yau, P. Raghavendra, 2020, COLT.

Coarse Differentiation and Multi-flows in Planar Graphs

Prasad Raghavendra, James R. Lee, James R. Lee, 2007, APPROX-RANDOM.

Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES

Prasad Raghavendra, David Steurer, David Steurer, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

List decoding tensor products and interleaved codes pdf

Prasad Raghavendra, Venkatesan Guruswami, Parikshit Gopalan, 2008, STOC '09.

How to Round Any CSP

Prasad Raghavendra, David Steurer, David Steurer, 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.

Bypassing UGC from Some Optimal Geometric Inapproximability Results

Prasad Raghavendra, Venkatesan Guruswami, Yi Wu, 2016, TALG.

Approximating CSPs with global cardinality constraints using SDP hierarchies

Prasad Raghavendra, Ning Tan, P. Raghavendra, 2011, SODA.

Finding Almost-Perfect Graph Bisections

Prasad Raghavendra, Venkatesan Guruswami, Yuan Zhou, 2011, ICS.

Reductions between Expansion Problems

Prasad Raghavendra, Madhur Tulsiani, David Steurer, 2010, 2012 IEEE 27th Conference on Computational Complexity.

The Complexity of Approximating Vertex Expansion

Prasad Raghavendra, Santosh S. Vempala, Anand Louis, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

Making the Long Code Shorter

Prasad Raghavendra, David Steurer, Johan Håstad, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

Local Statistics, Semidefinite Programming, and Community Detection pdf

Sidhanth Mohanty, Prasad Raghavendra, Jess Banks, 2019, SODA.

Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions

Prasad Raghavendra, Santosh S. Vempala, Prasad Tetali, 2011, APPROX-RANDOM.

On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique

Prasad Raghavendra, Pravesh Kothari, Tselil Schramm, 2016, SODA.

On mimicking networks representing minimum terminal cuts

Prasad Raghavendra, Arindam Khan, P. Raghavendra, 2012, Inf. Process. Lett..

On statistical inference when fixed points of belief propagation are unstable

Sidhanth Mohanty, Prasad Raghavendra, Siqi Liu, 2021, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS).

SDP Gaps and UGC Hardness for Multiway Cut , 0-Extension and Metric Labelling

Roy Schwartz, P. Raghavendra, J. Naor, 2008 .

Rounding Semidefinite Programming Hierarchies via Global Correlation

Prasad Raghavendra, David Steurer, Boaz Barak, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.