BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × Iceland
6 × USA
Collaborated with:
E.Ben-Sasson A.Klivans R.Meka S.Srinivasan I.Dinur G.Kindler S.Raskhodnikova S.Chien A.Sinclair O.Lachish A.Matsliah V.Guruswami J.Håstad G.Varma Y.Ishai J.Kilian K.Nissim S.Venkatesh O.Goldreich M.Sudan S.P.Vadhan I.Diakonikolas P.Raghavendra R.A.Servedio L.Tan
Talks about:
pcps (3) hard (3) polynomi (2) sensit (2) queri (2) long (2) code (2) low (2) polylogarithm (1) polyloglog (1)

Person: Prahladh Harsha

DBLP DBLP: Harsha:Prahladh

Contributed to:

STOC 20152015
STOC 20142014
STOC 20112011
STOC 20102010
ICALP (1) 20082008
ICALP 20042004
STOC 20042004
STOC 20032003

Wrote 9 papers:

STOC-2015-DinurHK #composition #fault #query
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (ID, PH, GK), pp. 267–276.
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes (VG, PH, JH, SS, GV), pp. 614–623.
STOC-2011-ChienHSS #commutative
Almost settling the hardness of noncommutative determinant (SC, PH, AS, SS), pp. 499–508.
STOC-2010-DiakonikolasHKMRST #bound #polynomial
Bounding the average sensitivity and noise sensitivity of polynomial threshold functions (ID, PH, AK, RM, PR, RAS, LYT), pp. 533–542.
An invariance principle for polytopes (PH, AK, RM), pp. 543–552.
Sound 3-Query PCPPs Are Long (EBS, PH, OL, AM), pp. 686–697.
ICALP-2004-HarshaIKNV #communication
Communication Versus Computation (PH, YI, JK, KN, SV), pp. 745–756.
STOC-2004-Ben-SassonGHSV #proximity #robust
Robust pcps of proximity, shorter pcps and applications to coding (EBS, OG, PH, MS, SPV), pp. 1–10.
Some 3CNF properties are hard to test (EBS, PH, SR), pp. 345–354.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.