Concepedia

Prahladh Harsha

PH

Statistics

Publications

21

Citations

999

H-Index

15

Active since

1999

Affiliations

Tata Institute of Fundamental Research(Current)

Massachusetts Institute of Technology

The University of Texas at Austin

Weizmann Institute of Science

Technion – Israel Institute of Technology

Prahladh Harsha is an author at Tata Institute of Fundamental Research specializing in algorithms, computing, and computer science.

ORCID

Publications per year

1999–2020

21

Publications

21

Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding

Eli Ben‐Sasson, Oded Goldreich, Prahladh Harsha et al. · SIAM Journal on Computing · 2006 · 240 citations · Full text

, , +15

Some 3CNF Properties Are Hard to Test

Eli Ben‐Sasson, Prahladh Harsha, Sofya Raskhodnikova · SIAM Journal on Computing · 2005 · 121 citations

, , +9

Short PCPs Verifiable in Polylogarithmic Time

Eli Ben‐Sasson, Oded Goldreich, Prahladh Harsha et al. · 2005 · 95 citations

, , +15

Complexity of Inference in Graphical Models

Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha · arXiv (Cornell University) · 2012 · 84 citations · Full text

, , +13

Robust pcps of proximity, shorter pcps and applications to coding

Eli Ben‐Sasson, Oded Goldreich, Prahladh Harsha et al. · 2004 · 82 citations

, , +16

1–5 of 21