| 2008 |
| 7 | EE | 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 |
| 6 | EE | Prasad Raghavendra:
Optimal algorithms and inapproximability results for every CSP?
STOC 2008: 245-254 |
| 2007 |
| 5 | EE | Kannan Srinathan,
Prasad Raghavendra,
C. Pandu Rangan:
On Proactive Perfectly Secure Message Transmission.
ACISP 2007: 461-473 |
| 4 | EE | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
APPROX-RANDOM 2007: 228-241 |
| 3 | EE | 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 |
| 2 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
A 3-query PCP over integers.
STOC 2007: 198-206 |
| 2006 |
| 1 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
Hardness of Learning Halfspaces with Noise.
FOCS 2006: 543-552 |