dblp.uni-trier.dewww.uni-trier.de

Prasad Raghavendra Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

*2009
20EEPrasad Raghavendra, David Steurer: Towards computing the Grothendieck constant. SODA 2009: 525-534
19EEYossi Azar, Uriel Feige, Iftah Gamzu, Thomas Moscibroda, Prasad Raghavendra: Buffer management for colored packets with deadlines. SPAA 2009: 319-327
18EEParikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List decoding tensor products and interleaved codes. STOC 2009: 13-22
17EEIlias Diakonikolas, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan: Average sensitivity and noise sensitivity of polynomial threshold functions CoRR abs/0909.5011: (2009)
16EEArpita Patra, Ashish Choudhary, C. Pandu Rangan, Kannan Srinathan, Prasad Raghavendra: Perfectly reliable and secure message transmission tolerating mobile adversary. IJACT 1(3): 200-224 (2009)
2008
15EEVenkatesan Guruswami, Prasad Raghavendra: Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. APPROX-RANDOM 2008: 77-90
14EEVenkatesan Guruswami, Rajsekar Manokaran, Prasad Raghavendra: Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. FOCS 2008: 573-582
13EERajsekar Manokaran, Joseph Naor, Prasad Raghavendra, Roy Schwartz: Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. STOC 2008: 11-20
12EEPrasad Raghavendra: Optimal algorithms and inapproximability results for every CSP? STOC 2008: 245-254
11EEParikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List Decoding Tensor Products and Interleaved Codes CoRR abs/0811.4395: (2008)
10EEVenkatesan 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)
9EEJames R. Lee, Prasad Raghavendra: Coarse Differentiation and Multi-flows in Planar Graphs. Electronic Colloquium on Computational Complexity (ECCC) 15(060): (2008)
8EEParikshit Gopalan, Venkatesan Guruswami, Prasad Raghavendra: List Decoding Tensor Products and Interleaved Codes. Electronic Colloquium on Computational Complexity (ECCC) 15(105): (2008)
2007
7EEKannan Srinathan, Prasad Raghavendra, C. Pandu Rangan: On Proactive Perfectly Secure Message Transmission. ACISP 2007: 461-473
6EEJames R. Lee, Prasad Raghavendra: Coarse Differentiation and Multi-flows in Planar Graphs. APPROX-RANDOM 2007: 228-241
5EENing 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
4EEVenkatesan Guruswami, Prasad Raghavendra: A 3-query PCP over integers. STOC 2007: 198-206
3EEPrasad Raghavendra: A Note on Yekhanin's Locally Decodable Codes. Electronic Colloquium on Computational Complexity (ECCC) 14(016): (2007)
2006
2EEVenkatesan Guruswami, Prasad Raghavendra: Hardness of Learning Halfspaces with Noise. FOCS 2006: 543-552
1EEVenkatesan Guruswami, Prasad Raghavendra: Hardness of Learning Halfspaces with Noise. Electronic Colloquium on Computational Complexity (ECCC) 13(061): (2006)

Coauthor Index

1Yossi Azar [19]
2Ning Chen [5]
3Ashish Choudhary [16]
4Ilias Diakonikolas [17]
5Roee Engelberg [5]
6Uriel Feige [19]
7Iftah Gamzu [19]
8Parikshit Gopalan [8] [11] [18]
9Venkatesan Guruswami [1] [2] [4] [8] [10] [11] [14] [15] [18]
10James R. Lee [6] [9]
11Rajsekar Manokaran [13] [14]
12Thomas Moscibroda [19]
13Joseph Naor (Seffi Naor) [13]
14C. Thach Nguyen [5]
15Arpita Patra [16]
16C. Pandu Rangan (Chandrasekaran Pandu Rangan) [7] [16]
17Atri Rudra [5]
18Roy Schwartz [13]
19Rocco A. Servedio [17]
20Gyanit Singh [5]
21K. Srinathan (Kannan Srinathan) [7] [16]
22David Steurer [20]
23Li-Yang Tan [17]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)