Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Harsha, Prahladh - School of Technology and Computer Science, Tata Institute of Fundamental Research
Complexity of Inference in Graphical Models Venkat Chandrasekaran
DistributedAutomata and Simple Test Tube Systems A Project Report
Small PCPs With Low Query Prahladh Harsha
International Journal of Foundations of Computer Science fl World Scientific Publishing Company
SIAM J. COMPUT. c 2006 Society for Industrial and Applied Mathematics Vol. 36, No. 4, pp. 889974
SIAM J. COMPUT. c # 2005 Society for Industrial and Applied Mathematics
Composition of lowerror 2query PCPs using decodable PCPs # Irit Dinur + Prahladh Harsha #
The Communication Complexity of Correlation Prahladh Harsha, Rahul Jain, David McAllester, and Jaikumar Radhakrishnan
Robust PCPs of Proximity and Shorter Prahladh Harsha
SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan
Minimizing Average Latency in Oblivious Routing Prahladh Harsha # Thomas P. Hayes # Hariharan Narayanan + Harald Racke #
SIAM J. COMPUT. c # 2006 Society for Industrial and Applied Mathematics
Composition of low-error 2-query PCPs using decodable PCPs Prahladh Harsha
Sound 3-Query PCPPs Are Long ELI BEN-SASSON and PRAHLADH HARSHA
Lower Bounds for Bounded Depth Frege Proofs via Pudlak-Buss Games
SMALL PCPS WITH LOW QUERY Prahladh Harsha and Madhu Sudan
Small PCPs With Low Query Prahladh Harsha
Robust PCPs of Proximity and Shorter Prahladh Harsha
Complexity of Inference in Graphical Models Venkat Chandrasekaran
Distributed-Automata and Simple Test Tube Systems A Project Report
International Journal of Foundations of Computer Science c World Scientific Publishing Company
Minimizing Average Latency in Oblivious Routing Prahladh Harsha
Sound 3Query PCPPs Are Long ELI BENSASSON and PRAHLADH HARSHA
comput. complex. 16 (2007), 1--33 10163328/07/01000133
SIAM J. COMPUT. c 2005 Society for Industrial and Applied Mathematics Vol. 35, No. 1, pp. 121
comput. complex. 16 (2007), 133 1016-3328/07/010001-33
