Prahladh Harsha

Cited by

	All	Since 2018
Citations	1668	714
h-index	18	14
i10-index	28	21

200

100

150

20032004200520062007200820092010201120122013201420152016201720182019202020212022202313 17 36 38 24 45 60 74 48 74 103 94 73 109 97 100 111 114 140 190 58

Public access

View all

7 articles

0 articles

available

not available

Based on funding mandates

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
Srikanth SrinivasanDepartment of Computer Science, Aarhus UniversityVerified email at cs.au.dk
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiVerified email at tifr.res.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
Ramprasad SaptharishiTata Institute of Fundamental ResearchVerified email at tifr.res.in
Raghu MekaUniversity of California, Los AngelesVerified email at cs.ucla.edu
Yuval FilmusAssociate Professor, TechnionVerified email at cs.technion.ac.il
Rahul JainProfessor, Computer Science, NUSVerified email at comp.nus.edu.sg
Adam KlivansProfessor of Computer Science, University of Texas at AustinVerified email at cs.utexas.edu
Sandeep JunejaTata Institute of Fundamental ResearchVerified email at tifr.res.in
Sofya RaskhodnikovaBoston UniversityVerified email at bu.edu
David McAllesterProfessor, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Nathan SrebroProfessor, TTIC and University of ChicagoVerified email at ttic.edu
Girish VarmaIIIT, HyderabadVerified email at iiit.ac.in
Rocco Anthony ServedioDepartment of Computer Science, Columbia UniversityVerified email at columbia.edu
Amey BhangaleUniversity of California, RiversideVerified email at cs.ucr.edu
Arie MatsliahPrinceton UniversityVerified email at princeton.edu
Oded LachishBirkbeck, University of LondonVerified email at dcs.bbk.ac.uk

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	343	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	186	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	179	2007
Complexity of inference in graphical models V Chandrasekaran, N Srebro, P Harsha arXiv preprint arXiv:1206.3240, 2012	153	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	129	2005
Bounding the sensitivity of polynomial threshold functions P Harsha, A Klivans, R Meka arXiv preprint arXiv:0909.5175, 2009	71*	2009
Composition of low-error 2-query PCPs using decodable PCPs I Dinur, P Harsha SIAM Journal on Computing 42 (6), 2452-2486, 2013	62	2013
Small PCPs with low query complexity P Harsha, M Sudan Computational Complexity 9 (3), 157-201, 2000	43	2000
An invariance principle for polytopes P Harsha, A Klivans, R Meka Journal of the ACM (JACM) 59 (6), 1-25, 2013	39	2013
City-scale agent-based simulators for the study of non-pharmaceutical interventions in the context of the COVID-19 epidemic: IISc-TIFR COVID-19 city-scale simulation team S Agrawal, S Bhandari, A Bhattacharjee, A Deo, NM Dixit, P Harsha, ... Journal of the Indian Institute of Science 100, 809-847, 2020	35	2020
Boolean functions on high-dimensional expanders Y Dikstein, I Dinur, Y Filmus, P Harsha arXiv preprint arXiv:1804.08155, 2018	33	2018
List-decoding with double samplers I Dinur, P Harsha, T Kaufman, IL Navon, A Ta-Shma SIAM journal on computing 50 (2), 301-349, 2021	32	2021
Distributed processing in automata K Krithivasan, NS BALAN, P Harsha International Journal of Foundations of Computer Science 10 (04), 443-463, 1999	30	1999
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes V Guruswami, P Harsha, J Håstad, S Srinivasan, G Varma Proceedings of the forty-sixth annual ACM symposium on Theory of computing …, 2014	29	2014
On polynomial approximations to AC P Harsha, S Srinivasan Random Structures & Algorithms 54 (2), 289-303, 2019	28	2019
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	25	2009
Rigid matrices from rectangular pcps or: Hard claims have complex proofs A Bhangale, P Harsha, O Paradise, A Tal 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	23	2020
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	22	2008
Explicit SoS lower bounds from high-dimensional expanders I Dinur, Y Filmus, P Harsha, M Tulsiani arXiv preprint arXiv:2009.05218, 2020	16	2020
Multiplayer parallel repetition for expander games I Dinur, P Harsha, R Venkat, H Yuen arXiv preprint arXiv:1610.08349, 2016	15	2016

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

Follow

Cited by

Co-authors