The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Prahladh Harsha: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Kamala Krithivasan, Prahladh Harsha, Muralidhar Talupur
    Communicating Distributed H systems with Simple Splicing Rules. [Citation Graph (0, 0)][DBLP]
    CDES, 2006, pp:107-111 [Conf]
  2. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Short PCPs Verifiable in Polylogarithmic Time. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2005, pp:120-134 [Conf]
  3. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
    Communication Versus Computation. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:745-756 [Conf]
  4. Prahladh Harsha, Madhu Sudan
    Small PCPs with Low Query Complexity. [Citation Graph (0, 0)][DBLP]
    STACS, 2001, pp:327-338 [Conf]
  5. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust pcps of proximity, shorter pcps and applications to coding. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:1-10 [Conf]
  6. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    Some 3CNF properties are hard to test. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:345-354 [Conf]
  7. Prahladh Harsha, Madhu Sudan
    Small PCPs with low query complexity. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2000, v:9, n:3-4, pp:157-201 [Journal]
  8. Prahladh Harsha, Madhu Sudan
    Small PCPs with low query complexity [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:61, pp:- [Journal]
  9. Eli Ben-Sasson, Prahladh Harsha
    Lower Bounds for Bounded-Depth Frege Proofs via Buss-Pudlack Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:004, pp:- [Journal]
  10. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    3CNF Properties are Hard to Test [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:006, pp:- [Journal]
  11. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs and Applications to Coding [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2004, v:, n:021, pp:- [Journal]
  12. Kamala Krithivasan, M. Sakthi Balan, Prahladh Harsha
    Distributed Processing in Automata. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1999, v:10, n:4, pp:443-464 [Journal]
  13. Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova
    Some 3CNF Properties Are Hard to Test. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:1, pp:1-21 [Journal]
  14. Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan
    Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:4, pp:889-974 [Journal]
  15. Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan
    The Communication Complexity of Correlation. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2007, pp:10-23 [Conf]
  16. Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh
    Communication vs. Computation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:1, pp:1-33 [Journal]

  17. Composition of Low-Error 2-Query PCPs Using Decodable PCPs. [Citation Graph (, )][DBLP]


  18. Sound 3-Query PCPPs Are Long. [Citation Graph (, )][DBLP]


  19. Minimizing average latency in oblivious routing. [Citation Graph (, )][DBLP]


  20. An invariance principle for polytopes. [Citation Graph (, )][DBLP]


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


  22. Complexity of Inference in Graphical Models. [Citation Graph (, )][DBLP]


  23. Bounding the Sensitivity of Polynomial Threshold Functions [Citation Graph (, )][DBLP]


  24. An Invariance Principle for Polytopes [Citation Graph (, )][DBLP]


  25. Limits of Approximation Algorithms: PCPs and Unique Games (DIMACS Tutorial Lecture Notes) [Citation Graph (, )][DBLP]


  26. Sound 3-query PCPPs are Long. [Citation Graph (, )][DBLP]


  27. The communication complexity of correlation. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.304secs
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
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002