Prahladh Harsha

Cited by

	All	Since 2016
Citations	1254	552
h-index	15	11
i10-index	19	14

140

105

2001200220032004200520062007200820092010201120122013201420152016201720182019202020215 3 5 17 38 37 24 44 58 67 50 74 91 87 72 112 89 106 116 121 8

Co-authors

Eli Ben-SassonCo-founder & President, StarkWareVerified email at starkware.co
Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityVerified email at cs.harvard.edu
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiVerified email at tifr.res.in
Srikanth SrinivasanDepartment of Mathematics, Indian Institute of Technology BombayVerified email at math.iitb.ac.in
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceVerified email at weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityVerified email at g.harvard.edu
Adam KlivansProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Raghu MekaUniversity of California, Los AngelesVerified email at cs.ucla.edu
Rahul JainProfessor, Computer Science, NUSVerified email at comp.nus.edu.sg
Sofya RaskhodnikovaBoston UniversityVerified email at bu.edu
Yuval FilmusAssistant Professor, TechnionVerified email at cs.technion.ac.il
Girish VarmaIIIT, HyderabadVerified email at iiit.ac.in
David McAllesterProfessor, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Nathan SrebroProfessor, TTIC and University of ChicagoVerified email at ttic.edu
Arie MatsliahGoogle inc.Verified email at google.com
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk
Ilias DiakonikolasUniversity of Wisconsin-MadisonVerified email at wisc.edu
Rocco Anthony ServedioDepartment of Computer Science, Columbia UniversityVerified email at cs.columbia.edu
Li-Yang TanStanford UniversityVerified email at cs.stanford.edu
Sakthi BalanAssociate ProfessorVerified email at lnmiit.ac.in

Prahladh Harsha

Tata Institute of Fundamental Research, Mumbai

Verified email at tifr.res.in - Homepage

Theoretical computer science computational complexity coding theory information theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Robust PCPs of proximity, shorter PCPs and applications to coding E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004	290	2004
Some 3CNF properties are hard to test E Ben-Sasson, P Harsha, S Raskhodnikova Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003	163	2003
The communication complexity of correlation P Harsha, R Jain, D McAllester, J Radhakrishnan Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07), 10-23, 2007	141	2007
Complexity of inference in graphical models V Chandrasekaran, N Srebro, P Harsha arXiv preprint arXiv:1206.3240, 2012	124	2012
Short PCPs verifiable in polylogarithmic time E Ben-Sasson, O Goldreich, P Harsha, M Sudan, S Vadhan Computational Complexity, 2005. Proceedings. Twentieth Annual IEEE …, 2005	109	2005
Bounding the sensitivity of polynomial threshold functions P Harsha, A Klivans, R Meka arXiv preprint arXiv:0909.5175, 2009	57*	2009
Composition of low-error 2-query PCPs using decodable PCPs I Dinur, P Harsha SIAM Journal on Computing 42 (6), 2452-2486, 2013	52	2013
Small PCPs with low query complexity P Harsha, M Sudan Computational Complexity 9 (3), 157-201, 2000	42	2000
Distributed processing in automata K Krithivasan, NS BALAN, P Harsha International Journal of Foundations of Computer Science 10 (04), 443-463, 1999	33	1999
An invariance principle for polytopes P Harsha, A Klivans, R Meka Journal of the ACM (JACM) 59 (6), 1-25, 2013	27	2013
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes V Guruswami, P Harsha, J Håstad, S Srinivasan, G Varma SIAM Journal on Computing 46 (1), 132-159, 2017	26	2017
Sound 3-query PCPPs are long E Ben-Sasson, P Harsha, O Lachish, A Matsliah ACM Transactions on Computation Theory (TOCT) 1 (2), 1-49, 2009	21	2009
On polynomial approximations to AC P Harsha, S Srinivasan Random Structures & Algorithms 54 (2), 289-303, 2019	19	2019
Minimizing average latency in oblivious routing P Harsha, TP Hayes, H Narayanan, H Räcke, J Radhakrishnan Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete …, 2008	18	2008
List decoding with double samplers I Dinur, P Harsha, T Kaufman, IL Navon, AT Shma Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	16	2019
Communication vs. computation P Harsha, Y Ishai, J Kilian, K Nissim, S Venkatesh computational complexity 16 (1), 1-33, 2007	13*	2007
Lower bounds for bounded depth Frege proofs via Pudlák-Buss games E Ben-Sasson, P Harsha ACM Transactions on Computational Logic (TOCL) 11 (3), 1-17, 2010	11	2010
Boolean functions on high-dimensional expanders Y Dikstein, I Dinur, Y Filmus, P Harsha arXiv preprint arXiv:1804.08155, 2018	10	2018
Polynomially low error PCPs with polyloglog n queries via modular composition I Dinur, P Harsha, G Kindler Proceedings of the forty-seventh annual ACM symposium on Theory of Computing …, 2015	10	2015
Almost settling the hardness of noncommutative determinant S Chien, P Harsha, A Sinclair, S Srinivasan Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011	9	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Upload PDF

Follow this author

Cited by

Co-authors