Prahladh Harsha

Citado por

	Total	Desde 2019
Citas	1880	832
Índice h	21	16
Índice i10	29	19

180

135

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202414 15 31 38 25 47 61 75 50 73 100 96 73 110 94 98 111 113 137 176 153 140

Acceso público

Ver todo

11 artículos

0 artículos

disponibles

no disponibles

Basado en requisitos de financiación

Coautores

Madhu SudanGordon McKay Professor of Computer Science, Harvard UniversityDirección de correo verificada de cs.harvard.edu
Yuval FilmusAssociate Professor, TechnionDirección de correo verificada de cs.technion.ac.il
Srikanth SrinivasanDepartment of Computer Science, University of CopenhagenDirección de correo verificada de di.ku.dk
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, MumbaiDirección de correo verificada de tifr.res.in
Ramprasad SaptharishiTata Institute of Fundamental ResearchDirección de correo verificada de tifr.res.in
Rahul JainProfessor, Computer Science, NUSDirección de correo verificada de comp.nus.edu.sg
Siddharth S BhandariTTIC, UChicagoDirección de correo verificada de uchicago.edu
Oded GoldreichProfessor of Computer Science, Weizmann Institute of ScienceDirección de correo verificada de weizmann.ac.il
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard UniversityDirección de correo verificada de g.harvard.edu
Raghu MekaUniversity of California, Los AngelesDirección de correo verificada de cs.ucla.edu
Adam KlivansProfessor of Computer Science, University of Texas at AustinDirección de correo verificada de cs.utexas.edu
Mrinal KumarTata Institute of Fundamental Research, MumbaiDirección de correo verificada de tifr.res.in
Sofya RaskhodnikovaBoston UniversityDirección de correo verificada de bu.edu
Sandeep JunejaTata Institute of Fundamental ResearchDirección de correo verificada de tifr.res.in
David McAllesterProfessor, Toyota Technological Institute at ChicagoDirección de correo verificada de ttic.edu
Nathan SrebroProfessor, TTIC and University of ChicagoDirección de correo verificada de ttic.edu
Amey BhangaleUniversity of California, RiversideDirección de correo verificada de cs.ucr.edu
Girish VarmaIIIT, HyderabadDirección de correo verificada de iiit.ac.in
Sharad ShriramGoogle Research IndiaDirección de correo verificada de google.com
Rajesh SundaresanECE and Centre for Cyber-Physical Systems, Indian Institute of ScienceDirección de correo verificada de iisc.ac.in

Seguir

Prahladh Harsha

Tata Institute of Fundamental Research, Mumbai

Dirección de correo verificada de tifr.res.in - Página principal

Theoretical computer science computational complexity coding theory information theory


Título Ordenar por citas Ordenar por año Ordenar por título	Citado por Citado por	Año
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	375	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	209	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	158	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	140	2005
Bounding the sensitivity of polynomial threshold functions P Harsha, A Klivans, R Meka arXiv preprint arXiv:0909.5175, 2009	74*	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	56	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	46	2021
Small PCPs with low query complexity P Harsha, M Sudan Computational Complexity 9 (3), 157-201, 2000	41	2000
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	40	2020
An invariance principle for polytopes P Harsha, A Klivans, R Meka Journal of the ACM (JACM) 59 (6), 1-25, 2013	40	2013
Distributed processing in automata K Krithivasan, NS Balan, P Harsha International Journal of Foundations of Computer Science 10 (04), 443-463, 1999	34	1999
On polynomial approximations to AC P Harsha, S Srinivasan Random Structures & Algorithms 54 (2), 289-303, 2019	33	2019
Rigid matrices from rectangular PCPs A Bhangale, P Harsha, O Paradise, A Tal SIAM Journal on Computing 53 (2), 480-523, 2024	31	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	26	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

El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.

Artículos 1–20

Citas por año

Citas duplicadas

Citas combinadas

Añadir coautoresCoautores

Seguir

Citado por

Coautores