|
Prasad Raghavendra |
|
Publications |
|
Contact : Computer Science and Engineering University of Washington Box 352350, Seattle WA 98195
|
|
Email : firstname @ cs dot washington dot edu Mobile : 1 206 288 3807 Office : 1 206 616 7045 |
|
I am a fourth year graduate student in Computer Science and Engineering at University of Washington, Seattle. My advisor is Venkatesan Guruswami. Before coming here, I got my Dual degree(Btech/Mtech) in computer science from IIT Madras. Research Interests : Approximation Algorithms, Hardness of Approximation, Complexity, Coding theory. I will be graduating in summer 2009. |
|
2009 |
||
|
Towards Computing the Grothendieck constant
SODA 09 |
|
|
|
How to Round Any CSP Prasad Raghavendra, David Steurer Submitted. |
|
|
|
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 Submitted |
|
|
|
Agnostic Learning of Monomials by Halfspaces is Hard Vitaly Feldman, Venkatesan Guruswami, Prasad Raghavendra, Yi Wu Submitted |
|
|
|
2008 |
||
|
Optimal Algorithms and Inapproximability Results for Every CSP?
(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
STOC 2008 |
|
|
|
Constraint Satisfaction over Non Boolean Domain : Approximation Algorithms and Unique Games Hardness APPROX-2008, also on Electronic Colloqium on Computational Complexity ECCC TR-08-008 |
|
|
|
Beating the Random Ordering is Hard : Inapproximability of Maximum Acyclic Subgraph
FOCS 2008 , Invited to SICOMP Special Issue. |
|
|
|
2007 |
||
|
A 3-Query PCP over Integers STOC 2007 |
|
|
|
Coarse Differentiation and Planar Multiflows
APPROX 2007 |
|
|
|
A Note on Yekhanin's Locally Decodable Codes
Electronic Colloqium on Computational Complexity ECCC TR07-016 |
|
|
|
Improved Approximation Algorithms for the Spanning Star Forest Problem APPROX 2007 |
|
|
|
2006 |
||
|
Hardness of Learning Halfspaces with Noise
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 |
|
|