The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Prasad Raghavendra: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Venkatesan Guruswami, Prasad Raghavendra
    Hardness of Learning Halfspaces with Noise. [Citation Graph (0, 0)][DBLP]
    FOCS, 2006, pp:543-552 [Conf]
  2. Kannan Srinathan, Prasad Raghavendra, C. Pandu Rangan
    On Proactive Perfectly Secure Message Transmission. [Citation Graph (0, 0)][DBLP]
    ACISP, 2007, pp:461-473 [Conf]
  3. Ning Chen, Roee Engelberg, C. Thach Nguyen, Prasad Raghavendra, Atri Rudra, Gyanit Singh
    Improved Approximation Algorithms for the Spanning Star Forest Problem. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:44-58 [Conf]
  4. James R. Lee, Prasad Raghavendra
    Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2007, pp:228-241 [Conf]
  5. Venkatesan Guruswami, Prasad Raghavendra
    A 3-query PCP over integers. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:198-206 [Conf]

  6. Constraint Satisfaction over a Non-Boolean Domain: Approximation Algorithms and Unique-Games Hardness. [Citation Graph (, )][DBLP]


  7. Approximating Sparsest Cut in Graphs of Bounded Treewidth. [Citation Graph (, )][DBLP]


  8. On the Communication Complexity of Read-Once AC^0 Formulae. [Citation Graph (, )][DBLP]


  9. Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph. [Citation Graph (, )][DBLP]


  10. Agnostic Learning of Monomials by Halfspaces Is Hard. [Citation Graph (, )][DBLP]


  11. How to Round Any CSP. [Citation Graph (, )][DBLP]


  12. Integrality Gaps for Strong SDP Relaxations of UNIQUE GAMES. [Citation Graph (, )][DBLP]


  13. Towards computing the Grothendieck constant. [Citation Graph (, )][DBLP]


  14. Buffer management for colored packets with deadlines. [Citation Graph (, )][DBLP]


  15. List decoding tensor products and interleaved codes. [Citation Graph (, )][DBLP]


  16. Optimal algorithms and inapproximability results for every CSP? [Citation Graph (, )][DBLP]


  17. Sdp gaps and ugc hardness for multiway cut, 0-extension, and metric labeling. [Citation Graph (, )][DBLP]


  18. Graph expansion and the unique games conjecture. [Citation Graph (, )][DBLP]


  19. Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. [Citation Graph (, )][DBLP]


  20. Approximations for the isoperimetric and spectral profile of graphs and related parameters. [Citation Graph (, )][DBLP]


  21. List Decoding Tensor Products and Interleaved Codes [Citation Graph (, )][DBLP]


  22. Average sensitivity and noise sensitivity of polynomial threshold functions [Citation Graph (, )][DBLP]


  23. Approximating Sparsest Cut in Graphs of Bounded Treewidth [Citation Graph (, )][DBLP]


  24. Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (, )][DBLP]


  25. Coarse Differentiation and Multi-flows in Planar Graphs. [Citation Graph (, )][DBLP]


  26. List Decoding Tensor Products and Interleaved Codes. [Citation Graph (, )][DBLP]


  27. Constraint Satisfaction over a Non-Boolean Domain: Approximation algorithms and Unique-Games hardness. [Citation Graph (, )][DBLP]


  28. A Note on Yekhanin's Locally Decodable Codes. [Citation Graph (, )][DBLP]


  29. Hardness of Learning Halfspaces with Noise. [Citation Graph (, )][DBLP]


Search in 0.023secs, Finished in 0.024secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002