Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPrasad Raghavendra
Person information
- affiliation: University of California at Berkeley, USA
- affiliation (former): Georgia Institute of Technology, Atlanta, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2022
[j19]Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra:
Approximating Rectangles by Juntas and Weakly Exponential Lower Bounds for LP Relaxations of CSPs. SIAM J. Comput. 51(2): 17-305 (2022)- 2018
- [j18]Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm:
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. ACM Trans. Algorithms 14(3): 28:1-28:31 (2018) - 2017
- [j17]Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. Math. Program. 165(2): 643-662 (2017) - 2016
- [j16]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. J. ACM 63(4): 34:1-34:22 (2016) - [j15]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from Some Optimal Geometric Inapproximability Results. ACM Trans. Algorithms 12(1): 6:1-6:25 (2016) - 2015
- [j14]Boaz Barak, Parikshit Gopalan, Johan Håstad
, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. SIAM J. Comput. 44(5): 1287-1324 (2015) - 2014
- [j13]Arindam Khan, Prasad Raghavendra:
On mimicking networks representing minimum terminal cuts. Inf. Process. Lett. 114(7): 365-371 (2014) - [j12]Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan:
Average Sensitivity and Noise Sensitivity of Polynomial Threshold Functions. SIAM J. Comput. 43(1): 231-253 (2014) - 2013
- [j11]Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. Algorithmica 65(3): 498-516 (2013) - [j10]Shuchi Chawla, Prasad Raghavendra, Dana Randall:
Foreword to the Special Issue on SODA'11. ACM Trans. Algorithms 9(3): 20:1 (2013) - 2012
- [j9]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Comb. Probab. Comput. 21(6): 835-855 (2012) - [j8]Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu:
Agnostic Learning of Monomials by Halfspaces Is Hard. SIAM J. Comput. 41(6): 1558-1590 (2012) - 2011
- [j7]Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer Management for Colored Packets with Deadlines. Theory Comput. Syst. 49(4): 738-756 (2011) - [j6]Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar:
Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant. SIAM J. Comput. 40(3): 878-914 (2011) - [j5]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes. SIAM J. Comput. 40(5): 1432-1462 (2011) - 2010
- [j4]James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. Discret. Comput. Geom. 43(2): 346-362 (2010) - 2009
- [j3]Arpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra:
Perfectly reliable and secure message transmission tolerating mobile adversary. Int. J. Appl. Cryptogr. 1(3): 200-224 (2009) - [j2]Venkatesan Guruswami, Prasad Raghavendra:
Hardness of Learning Halfspaces with Noise. SIAM J. Comput. 39(2): 742-765 (2009) - [j1]Venkatesan Guruswami, Prasad Raghavendra:
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. ACM Trans. Comput. Theory 1(2): 6:1-6:20 (2009)
Conference and Workshop Papers
- 2023
- [c59]Prasad Raghavendra:
On Measuring Average Case Complexity via Sum-Of-Squares Degree (Invited Talk). FSTTCS 2023: 2:1-2:1 - [c58]Ronen Eldan, Dan Mikulincer, Prasad Raghavendra:
Noise Stability on the Boolean Hypercube via a Renormalized Brownian Motion. STOC 2023: 661-671 - 2022
- [c57]Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty:
Matrix discrepancy from Quantum communication. STOC 2022: 637-648 - 2021
- [c56]Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra:
On statistical inference when fixed points of belief propagation are unstable. FOCS 2021: 395-405 - [c55]Jess Banks, Sidhanth Mohanty, Prasad Raghavendra:
Local Statistics, Semidefinite Programming, and Community Detection. SODA 2021: 1298-1316 - 2020
- [c54]Prasad Raghavendra, Morris Yau:
List Decodable Subspace Recovery. COLT 2020: 3206-3226 - [c53]Prasad Raghavendra, Morris Yau:
List Decodable Learning via Sum of Squares. SODA 2020: 161-180 - [c52]Jonah Brown-Cohen, Prasad Raghavendra:
Extended Formulation Lower Bounds for Refuting Random CSPs. SODA 2020: 305-324 - [c51]Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni:
Algorithms for heavy-tailed statistics: regression, covariance estimation, and beyond. STOC 2020: 601-609 - [c50]Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu:
Lifting sum-of-squares lower bounds: degree-2 to degree-4. STOC 2020: 840-853 - 2019
- [c49]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz:
Exponential Lower Bounds on Spectrahedral Representations of Hyperbolicity Cones. SODA 2019: 2322-2332 - 2018
- [c48]Badih Ghazi, Pritish Kamath, Prasad Raghavendra:
Dimension Reduction for Polynomials over Gaussian Space and Applications. CCC 2018: 28:1-28:37 - [c47]Luca Becchetti, Andrea Clementi, Pasin Manurangsi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Average Whenever You Meet: Opportunistic Protocols for Community Detection. ESA 2018: 7:1-7:13 - 2017
- [c46]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The Power of Sum-of-Squares for Detecting Hidden Structures. FOCS 2017: 720-731 - [c45]Pasin Manurangsi, Prasad Raghavendra:
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. ICALP 2017: 78:1-78:15 - [c44]Prasad Raghavendra, Benjamin Weitz:
On the Bit Complexity of Sum-of-Squares Proofs. ICALP 2017: 80:1-80:13 - [c43]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava:
Real Stability Testing. ITCS 2017: 5:1-5:15 - [c42]Prasad Raghavendra, Satish Rao, Tselil Schramm:
Strongly refuting random CSPs below the spectral threshold. STOC 2017: 121-131 - [c41]Pravesh K. Kothari, Raghu Meka, Prasad Raghavendra:
Approximating rectangles by juntas and weakly-exponential lower bounds for LP relaxations of CSPs. STOC 2017: 590-603 - 2016
- [c40]Jonah Brown-Cohen, Prasad Raghavendra:
Correlation Decay and Tractability of CSPs. ICALP 2016: 79:1-79:13 - [c39]Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. SODA 2016: 1067-1078 - [c38]Samuel B. Hopkins, Pravesh Kothari, Aaron Henry Potechin, Prasad Raghavendra, Tselil Schramm:
On the Integrality Gap of Degree-4 Sum of Squares for Planted Clique. SODA 2016: 1079-1095 - 2015
- [c37]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the Random Assignment on Constraint Satisfaction Problems of Bounded Degree. APPROX-RANDOM 2015: 110-123 - [c36]James R. Lee, Prasad Raghavendra, David Steurer:
Lower Bounds on the Size of Semidefinite Programming Relaxations. STOC 2015: 567-576 - 2014
- [c35]Prasad Raghavendra, Tselil Schramm:
Gap Amplification for Small-Set Expansion via Random Walks. APPROX-RANDOM 2014: 381-391 - [c34]James R. Lee, Prasad Raghavendra, David Steurer, Ning Tan:
On the Power of Symmetric LP and SDP Relaxations. CCC 2014: 13-21 - [c33]Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz:
Computational Limits for Matrix Completion. COLT 2014: 703-725 - 2013
- [c32]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. FOCS 2013: 350-359 - [c31]Anand Louis, Prasad Raghavendra, Santosh S. Vempala:
The Complexity of Approximating Vertex Expansion. FOCS 2013: 360-369 - 2012
- [c30]Prasad Raghavendra, David Steurer, Madhur Tulsiani:
Reductions between Expansion Problems. CCC 2012: 64-73 - [c29]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the Long Code Shorter. FOCS 2012: 370-379 - [c28]Prasad Raghavendra, Ning Tan:
Approximating CSPs with global cardinality constraints using SDP hierarchies. SODA 2012: 373-387 - [c27]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. SODA 2012: 699-717 - [c26]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing odd-cycle-freeness in Boolean functions. SODA 2012: 1140-1149 - [c25]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Many sparse cuts via higher eigenvalues. STOC 2012: 1131-1140 - 2011
- [c24]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Algorithmic Extensions of Cheeger's Inequality to Higher Eigenvalues and Partitions. APPROX-RANDOM 2011: 315-326 - [c23]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. FOCS 2011: 472-481 - [c22]Venkatesan Guruswami, Yury Makarychev, Prasad Raghavendra, David Steurer, Yuan Zhou:
Finding Almost-Perfect Graph Bisections. ICS 2011: 321-337 - [c21]Prasad Raghavendra:
Generic Techniques to Round SDP Relaxations. MFCS 2011: 34 - 2010
- [c20]Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra:
Approximating Sparsest Cut in Graphs of Bounded Treewidth. APPROX-RANDOM 2010: 124-137 - [c19]Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan:
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. STOC 2010: 533-542 - [c18]Prasad Raghavendra, David Steurer, Prasad Tetali:
Approximations for the isoperimetric and spectral profile of graphs and related parameters. STOC 2010: 631-640 - [c17]Prasad Raghavendra, David Steurer:
Graph expansion and the unique games conjecture. STOC 2010: 755-764 - 2009
- [c16]T. S. Jayram, Swastik Kopparty, Prasad Raghavendra:
On the Communication Complexity of Read-Once AC^0 Formulae. CCC 2009: 329-340 - [c15]Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu:
Agnostic Learning of Monomials by Halfspaces Is Hard. FOCS 2009: 385-394 - [c14]Prasad Raghavendra, David Steurer:
Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. FOCS 2009: 575-585 - [c13]Prasad Raghavendra, David Steurer:
How to Round Any CSP. FOCS 2009: 586-594 - [c12]Prasad Raghavendra, David Steurer:
Towards computing the Grothendieck constant. SODA 2009: 525-534 - [c11]Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra:
Buffer management for colored packets with deadlines. SPAA 2009: 319-327 - [c10]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List decoding tensor products and interleaved codes. STOC 2009: 13-22 - 2008
- [c9]Venkatesan Guruswami, Prasad Raghavendra:
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. APPROX-RANDOM 2008: 77-90 - [c8]Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra:
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS 2008: 573-582 - [c7]Rajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz:
Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC 2008: 11-20 - [c6]Prasad Raghavendra:
Optimal algorithms and inapproximability results for every CSP? STOC 2008: 245-254 - 2007
- [c5]Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan:
On Proactive Perfectly Secure Message Transmission. ACISP 2007: 461-473 - [c4]Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh:
Improved Approximation Algorithms for the Spanning Star Forest Problem. APPROX-RANDOM 2007: 44-58 - [c3]James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. APPROX-RANDOM 2007: 228-241 - [c2]Venkatesan Guruswami, Prasad Raghavendra:
A 3-query PCP over integers. STOC 2007: 198-206 - 2006
- [c1]Venkatesan Guruswami, Prasad Raghavendra:
Hardness of Learning Halfspaces with Noise. FOCS 2006: 543-552
Editorship
- 2013
- [e1]Prasad Raghavendra, Sofya Raskhodnikova, Klaus Jansen, José D. P. Rolim:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 16th International Workshop, APPROX 2013, and 17th International Workshop, RANDOM 2013, Berkeley, CA, USA, August 21-23, 2013. Proceedings. Lecture Notes in Computer Science 8096, Springer 2013, ISBN 978-3-642-40327-9 [contents]
Informal and Other Publications
- 2024
- [i57]Parikshit Gopalan, Princewill Okoroafor, Prasad Raghavendra, Abhishek Shetty, Mihir Singhal:
Omnipredictors for Regression and the Approximate Rank of Convex Functions. CoRR abs/2401.14645 (2024) - [i56]Sidhanth Mohanty, Prasad Raghavendra, David X. Wu:
Robust recovery for stochastic block models, simplified and generalized. CoRR abs/2402.13921 (2024) - 2022
- [i55]Ronen Eldan, Dan Mikulincer, Prasad Raghavendra:
Noise stability on the Boolean hypercube via a renormalized Brownian motion. CoRR abs/2208.06508 (2022) - 2021
- [i54]Siqi Liu, Sidhanth Mohanty, Prasad Raghavendra:
Computational phase transitions in sparse planted problems? CoRR abs/2101.10882 (2021) - [i53]Samuel B. Hopkins, Prasad Raghavendra, Abhishek Shetty:
Matrix Discrepancy from Quantum Communication. CoRR abs/2110.10099 (2021) - 2020
- [i52]Prasad Raghavendra, Morris Yau:
List Decodable Subspace Recovery. CoRR abs/2002.03004 (2020) - 2019
- [i51]Prasad Raghavendra, Morris Yau:
List Decodable Learning via Sum of Squares. CoRR abs/1905.04660 (2019) - [i50]Sidhanth Mohanty, Prasad Raghavendra, Jeff Xu:
Lifting Sum-of-Squares Lower Bounds: Degree-2 to Degree-4. CoRR abs/1911.01411 (2019) - [i49]Jess Banks, Sidhanth Mohanty, Prasad Raghavendra:
Local Statistics, Semidefinite Programming, and Community Detection. CoRR abs/1911.01960 (2019) - [i48]Jonah Brown-Cohen, Prasad Raghavendra:
Extended Formulation Lower Bounds for Refuting Random CSPs. CoRR abs/1911.02911 (2019) - [i47]Yeshwanth Cherapanamjeri, Samuel B. Hopkins, Tarun Kathuria, Prasad Raghavendra, Nilesh Tripuraneni:
Algorithms for Heavy-Tailed Statistics: Regression, Covariance Estimation, and Beyond. CoRR abs/1912.11071 (2019) - 2018
- [i46]Prasad Raghavendra, Tselil Schramm, David Steurer:
High-dimensional estimation via sum-of-squares proofs. CoRR abs/1807.11419 (2018) - 2017
- [i45]Prasad Raghavendra, Benjamin Weitz:
On the Bit Complexity of Sum-of-Squares Proofs. CoRR abs/1702.05139 (2017) - [i44]Luca Becchetti, Andrea Clementi, Emanuele Natale, Francesco Pasquale, Prasad Raghavendra, Luca Trevisan:
Friend or Foe? Population Protocols can perform Community Detection. CoRR abs/1703.05045 (2017) - [i43]Badih Ghazi, Pritish Kamath, Prasad Raghavendra:
Dimension Reduction for Polynomials over Gaussian Space and Applications. CoRR abs/1708.03808 (2017) - [i42]Samuel B. Hopkins, Pravesh K. Kothari, Aaron Potechin, Prasad Raghavendra, Tselil Schramm, David Steurer:
The power of sum-of-squares for detecting hidden structures. CoRR abs/1710.05017 (2017) - [i41]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava, Benjamin Weitz:
Exponential lower bounds on spectrahedral representations of hyperbolicity cones. CoRR abs/1711.11497 (2017) - [i40]Badih Ghazi, Pritish Kamath, Prasad Raghavendra:
Dimension Reduction for Polynomials over Gaussian Space and Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [i39]Prasad Raghavendra, Satish Rao, Tselil Schramm:
Strongly Refuting Random CSPs Below the Spectral Threshold. CoRR abs/1605.00058 (2016) - [i38]Pasin Manurangsi, Prasad Raghavendra:
A Birthday Repetition Theorem and Complexity of Approximating Dense CSPs. CoRR abs/1607.02986 (2016) - [i37]Prasad Raghavendra, Nick Ryder, Nikhil Srivastava:
Real Stability Testing. CoRR abs/1610.00209 (2016) - [i36]Pravesh Kothari, Raghu Meka, Prasad Raghavendra:
Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs. CoRR abs/1610.02704 (2016) - 2015
- [i35]Jonah Brown-Cohen, Prasad Raghavendra:
Combinatorial Optimization Algorithms via Polymorphisms. CoRR abs/1501.01598 (2015) - [i34]Gábor Braun, Jonah Brown-Cohen, Arefin Huq, Sebastian Pokutta, Prasad Raghavendra, Aurko Roy, Benjamin Weitz, Daniel Zink:
The matching problem has no small symmetric SDP. CoRR abs/1504.00703 (2015) - [i33]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. CoRR abs/1505.03424 (2015) - [i32]Prasad Raghavendra, Tselil Schramm:
Tight Lower Bounds for Planted Clique in the Degree-4 SOS Program. CoRR abs/1507.05136 (2015) - [i31]Boaz Barak, Ankur Moitra, Ryan O'Donnell, Prasad Raghavendra, Oded Regev, David Steurer, Luca Trevisan, Aravindan Vijayaraghavan, David Witmer, John Wright:
Beating the random assignment on constraint satisfaction problems of bounded degree. Electron. Colloquium Comput. Complex. TR15 (2015) - [i30]Jonah Brown-Cohen, Prasad Raghavendra:
Combinatorial Optimization Algorithms via Polymorphisms. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i29]Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz:
Computational Limits for Matrix Completion. CoRR abs/1402.2331 (2014) - [i28]James R. Lee, Prasad Raghavendra, David Steurer:
Lower bounds on the size of semidefinite programming relaxations. CoRR abs/1411.6317 (2014) - 2013
- [i27]Anand Louis, Prasad Raghavendra, Santosh S. Vempala:
The Complexity of Approximating Vertex Expansion. CoRR abs/1304.3139 (2013) - [i26]Siu On Chan, James R. Lee, Prasad Raghavendra, David Steurer:
Approximate Constraint Satisfaction Requires Large LP Relaxations. CoRR abs/1309.0563 (2013) - [i25]Prasad Raghavendra, Tselil Schramm:
Gap Amplification for Small-Set Expansion via Random Walks. CoRR abs/1310.1493 (2013) - 2012
- [i24]Arindam Khan, Prasad Raghavendra, Prasad Tetali, László A. Végh:
On Mimicking Networks Representing Minimum Terminal Cuts. CoRR abs/1207.6371 (2012) - 2011
- [i23]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. CoRR abs/1104.4680 (2011) - [i22]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. CoRR abs/1105.1325 (2011) - [i21]Prasad Raghavendra, Ning Tan:
Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies. CoRR abs/1110.1064 (2011) - [i20]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the long code shorter, with applications to the Unique Games Conjecture. CoRR abs/1111.0405 (2011) - [i19]Anand Louis, Prasad Raghavendra, Prasad Tetali, Santosh S. Vempala:
Many Sparse Cuts via Higher Eigenvalues. CoRR abs/1111.0965 (2011) - [i18]Boaz Barak, Parikshit Gopalan, Johan Håstad, Raghu Meka, Prasad Raghavendra, David Steurer:
Making the long code shorter, with applications to the Unique Games Conjecture. Electron. Colloquium Comput. Complex. TR11 (2011) - [i17]Boaz Barak, Prasad Raghavendra, David Steurer:
Rounding Semidefinite Programming Hierarchies via Global Correlation. Electron. Colloquium Comput. Complex. TR11 (2011) - [i16]Arnab Bhattacharyya, Elena Grigorescu, Prasad Raghavendra, Asaf Shapira:
Testing Odd-Cycle-Freeness in Boolean Functions. Electron. Colloquium Comput. Complex. TR11 (2011) - [i15]Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, Moses Charikar:
Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i14]Eden Chlamtac, Robert Krauthgamer, Prasad Raghavendra:
Approximating Sparsest Cut in Graphs of Bounded Treewidth. CoRR abs/1006.3970 (2010) - [i13]Prasad Raghavendra, David Steurer, Madhur Tulsiani:
Reductions Between Expansion Problems. CoRR abs/1011.2586 (2010) - [i12]Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu:
Agnostic Learning of Monomials by Halfspaces is Hard. CoRR abs/1012.0729 (2010) - [i11]Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu:
Agnostic Learning of Monomials by Halfspaces is Hard. Electron. Colloquium Comput. Complex. TR10 (2010) - [i10]Venkatesan Guruswami, Prasad Raghavendra, Rishi Saket, Yi Wu:
Bypassing UGC from some optimal geometric inapproximability results. Electron. Colloquium Comput. Complex. TR10 (2010) - [i9]Prasad Raghavendra, David Steurer, Madhur Tulsiani:
Reductions Between Expansion Problems. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [i8]Ilias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan:
Average sensitivity and noise sensitivity of polynomial threshold functions. CoRR abs/0909.5011 (2009) - [i7]Venkatesan Guruswami, Prasad Raghavendra:
Hardness of Solving Sparse Overdetermined Linear Systems: A 3-Query PCP over Integers. Electron. Colloquium Comput. Complex. TR09 (2009) - 2008
- [i6]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes. CoRR abs/0811.4395 (2008) - [i5]Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes. Electron. Colloquium Comput. Complex. TR08 (2008) - [i4]Venkatesan Guruswami, Prasad Raghavendra:
Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. Electron. Colloquium Comput. Complex. TR08 (2008) - [i3]James R. Lee, Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [i2]Prasad Raghavendra:
A Note on Yekhanin's Locally Decodable Codes. Electron. Colloquium Comput. Complex. TR07 (2007) - 2006
- [i1]Venkatesan Guruswami, Prasad Raghavendra:
Hardness of Learning Halfspaces with Noise. Electron. Colloquium Comput. Complex. TR06 (2006)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
