| 2009 |
|---|
| 17 | EE | Prasad Raghavendra,
David Steurer:
Towards computing the Grothendieck constant.
SODA 2009: 525-534 |
| 2008 |
|---|
| 16 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness.
APPROX-RANDOM 2008: 77-90 |
| 15 | EE | Venkatesan Guruswami,
Rajsekar Manokaran,
Prasad Raghavendra:
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph.
FOCS 2008: 573-582 |
| 14 | 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 |
| 13 | EE | Prasad Raghavendra:
Optimal algorithms and inapproximability results for every CSP?
STOC 2008: 245-254 |
| 12 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes
CoRR abs/0811.4395: (2008) |
| 11 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness.
Electronic Colloquium on Computational Complexity (ECCC) 15(008): (2008) |
| 10 | EE | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
Electronic Colloquium on Computational Complexity (ECCC) 15(060): (2008) |
| 9 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Prasad Raghavendra,
Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes.
Electronic Colloquium on Computational Complexity (ECCC) 15(105): (2008) |
| 8 | EE | Parikshit Gopalan,
Venkatesan Guruswami,
Prasad Raghavendra,
Prasad Raghavendra:
List Decoding Tensor Products and Interleaved Codes.
Electronic Colloquium on Computational Complexity (ECCC) 15(105): (2008) |
| 2007 |
|---|
| 7 | EE | Kannan Srinathan,
Prasad Raghavendra,
C. Pandu Rangan:
On Proactive Perfectly Secure Message Transmission.
ACISP 2007: 461-473 |
| 6 | EE | James R. Lee,
Prasad Raghavendra:
Coarse Differentiation and Multi-flows in Planar Graphs.
APPROX-RANDOM 2007: 228-241 |
| 5 | 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 |
| 4 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
A 3-query PCP over integers.
STOC 2007: 198-206 |
| 3 | EE | Prasad Raghavendra:
A Note on Yekhanin's Locally Decodable Codes.
Electronic Colloquium on Computational Complexity (ECCC) 14(016): (2007) |
| 2006 |
|---|
| 2 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
Hardness of Learning Halfspaces with Noise.
FOCS 2006: 543-552 |
| 1 | EE | Venkatesan Guruswami,
Prasad Raghavendra:
Hardness of Learning Halfspaces with Noise.
Electronic Colloquium on Computational Complexity (ECCC) 13(061): (2006) |
