Prahladh Harsha

Citata da

	Tutte	Dal 2019
Citazioni	1912	862
Indice H	21	16
i10-index	29	19

180

135

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202414 15 31 38 25 47 61 75 50 73 100 96 73 110 95 99 110 113 136 177 153 171

Accesso pubblico

Visualizza tutto

11 articoli

0 articoli

Disponibili

Non disponibili

In base ai mandati di finanziamento

Coautori

Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityEmail verificata su cs.harvard.edu
Yuval FilmusAssociate Professor, TechnionEmail verificata su cs.technion.ac.il
Srikanth SrinivasanDepartment of Computer Science, University of CopenhagenEmail verificata su di.ku.dk
Ramprasad SaptharishiTata Institute of Fundamental ResearchEmail verificata su tifr.res.in
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiEmail verificata su tifr.res.in
Rahul JainProfessor, Computer Science, NUSEmail verificata su comp.nus.edu.sg
Siddharth S BhandariTTIC, UChicagoEmail verificata su uchicago.edu
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceEmail verificata su weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityEmail verificata su g.harvard.edu
Raghu MekaUniversity of California, Los AngelesEmail verificata su cs.ucla.edu
Adam KlivansProfessor of Computer Science, University of Texas at AustinEmail verificata su cs.utexas.edu
Mrinal KumarTata Institute of Fundamental Research, MumbaiEmail verificata su tifr.res.in
Sofya RaskhodnikovaBoston UniversityEmail verificata su bu.edu
Sandeep JunejaTata Institute of Fundamental ResearchEmail verificata su tifr.res.in
David McAllesterProfessor, Toyota Technological Institute at ChicagoEmail verificata su ttic.edu
Nathan SrebroProfessor, TTIC and University of ChicagoEmail verificata su ttic.edu
Amey BhangaleUniversity of California, RiversideEmail verificata su cs.ucr.edu
Girish VarmaIIIT, HyderabadEmail verificata su iiit.ac.in
Sharad ShriramGoogle Research IndiaEmail verificata su google.com
Rajesh SundaresanECE and Centre for Cyber-Physical Systems, Indian Institute of ScienceEmail verificata su iisc.ac.in

Segui

Prahladh Harsha

Tata Institute of Fundamental Research, Mumbai

Email verificata su tifr.res.in - Home page

Theoretical computer science computational complexity coding theory information theory


Titolo Ordina per citazioni Ordina per anno Ordina per titolo	Citata da Citata da	Anno
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	380	2004
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	218	2007
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	189	2003
Complexity of inference in graphical models V Chandrasekaran, N Srebro, P Harsha arXiv preprint arXiv:1206.3240, 2012	160	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	141	2005
Bounding the sensitivity of polynomial threshold functions P Harsha, A Klivans, R Meka arXiv preprint arXiv:0909.5175, 2009	75*	2009
Composition of low-error 2-query PCPs using decodable PCPs I Dinur, P Harsha SIAM Journal on Computing 42 (6), 2452-2486, 2013	66	2013
Boolean function analysis on high-dimensional expanders Y Dikstein, I Dinur, Y Filmus, P Harsha Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018	57*	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	47	2021
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	41	2020
Small PCPs with low query complexity P Harsha, M Sudan Computational Complexity 9 (3), 157-201, 2000	41	2000
An invariance principle for polytopes P Harsha, A Klivans, R Meka Journal of the ACM (JACM) 59 (6), 1-25, 2013	40	2013
On polynomial approximations to AC P Harsha, S Srinivasan Random Structures & Algorithms 54 (2), 289-303, 2019	34	2019
Distributed processing in automata K Krithivasan, NS Balan, P Harsha International Journal of Foundations of Computer Science 10 (04), 443-463, 1999	34	1999
Rigid matrices from rectangular PCPs A Bhangale, P Harsha, O Paradise, A Tal SIAM Journal on Computing 53 (2), 480-523, 2024	32	2024
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
Explicit SoS lower bounds from high-dimensional expanders I Dinur, Y Filmus, P Harsha, M Tulsiani arXiv preprint arXiv:2009.05218, 2020	27	2020
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	26	2009
Minimizing average latency in oblivious routing. P Harsha, TP Hayes, H Narayanan, H Räcke, J Radhakrishnan SODA, 200-207, 2008	24	2008
Locally testable codes via high-dimensional expanders Y Dikstein, I Dinur, P Harsha, N Ron-Zewi arXiv preprint arXiv:2005.01045, 2020	22	2020

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Segui

Citata da

Coautori