I am a postdoctoral researcher at Microsoft Research New England.
I received my Phd from Computer Science and Engineering Department at University of Washington, Seattle, advised by Venkatesan Guruswami. Earlier, I got my Dual degree(Btech/Mtech) in computer science from IIT Madras.
Research Interests : Approximation Algorithms, Hardness of Approximation, Complexity, Coding theory.
Contact :
|
Microsoft Research New England One Memorial Drive, 14th Floor Cambridge, MA 02139
|
Email : firstname @ cs dot washington dot edu Mobile : 1 206 288 3807 Office : 1 206 616 7045
|
Publications
|
2009 |
||
|
Towards Computing the Grothendieck constant Prasad Raghavendra, David Steurer SODA 09 |
|
|
|
How to Round Any CSP Prasad Raghavendra, David Steurer FOCS 09 |
|
|
|
List Decoding Tensor Products and Interleaved Codes. Parikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra STOC 2009 |
|
|
|
Communication Complexity of Read-Once AC0 Formulae T.S.Jayram, Swastik Kopparty, Prasad Raghavendra CCC 2009 |
|
|
|
Integrality Gaps for Strong SDP Relaxations of Unique Games Prasad Raghavendra, David Stuerer FOCS 2009 |
|
|
|
Agnostic Learning of Monomials by Halfspaces is Hard Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu FOCS 2009 |
|
|
|
Buffer Management for Colored Packets with Deadlines Yossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda and Prasad Raghavendra SPAA 2009, Invited to SPAA 2009 Special Issue |
|
|
|
2008 |
||
Optimal Algorithms and Inapproximability Results for Every CSP? Prasad Raghavendra (Co-winner of the Best Paper award and winner of the Best Student Paper award) STOC 2008 |
|
|
|
SDP Gaps and UGC Hardness for Multiway Cut, 0-Extension and Metric Labeling Rajsekar Manokaran, Seffi Naor, Prasad Raghavendra, Roy Schwartz STOC 2008 |
|
|
|
Constraint Satisfaction over Non Boolean Domain : Approximation Algorithms and Unique Games Hardness Venkatesan Guruswami, Prasad Raghavendra APPROX-2008, also on Electronic Colloqium on Computational Complexity ECCC TR-08-008 |
|
|
|
Beating the Random Ordering is Hard : Inapproximability of Maximum Acyclic Subgraph Venkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra FOCS 2008, Invited to SICOMP Special Issue. |
|
|
2007 |
||
|
A 3-Query PCP over Integers Venkatesan Guruswami, Prasad Raghavendra STOC 2007 |
|
|
|
Coarse Differentiation and Planar Multiflows James Lee, Prasad Raghavendra APPROX 2007 |
|
|
|
A Note on Yekhanin's Locally Decodable Codes Prasad Raghavendra Electronic Colloqium on Computational Complexity ECCC TR07-016 |
|
|
|
Improved Approximation Algorithms for the Spanning Star Forest Problem Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh APPROX 2007 |
|
|
|
2006 |
||
|
Hardness of Learning Halfspaces with Noise Venkatesan Guruswami, Prasad Raghavendra. FOCS 2006, Invited to SICOMP Special Issue |
|
|
|
Undergraduate: |
||
|
On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication Kannan Srinathan, N. R. Prasad, C. Pandu Rangan IEEE Symposium on Security and Privacy (IEEE-SP) 2007 |
|
|
|
On Proactive Perfectly Secure Message Transmission Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan Australasian Conference on Security and Privacy (ACISP) 2007 |
|
|
