Prahladh Harsha 个人学术档案

引用次数

	总计	2019 年至今
引用	1857	810
h 指数	21	15
i10 指数	29	19

180

135

200320042005200620072008200920102011201220132014201520162017201820192020202120222023202414 15 31 38 25 47 61 75 50 73 100 95 73 110 94 98 110 113 136 179 156 115

开放获取的出版物数量

查看全部

11 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Madhu SudanGordon McKay Professor of Computer Science, Harvard University在 cs.harvard.edu 的电子邮件经过验证
Yuval FilmusAssociate Professor, Technion在 cs.technion.ac.il 的电子邮件经过验证
Srikanth SrinivasanDepartment of Computer Science, University of Copenhagen在 di.ku.dk 的电子邮件经过验证
Jaikumar RadhakrishnanProfessor at Tata Institute of Fundamental Research, Mumbai在 tifr.res.in 的电子邮件经过验证
Ramprasad SaptharishiTata Institute of Fundamental Research在 tifr.res.in 的电子邮件经过验证
Rahul JainProfessor, Computer Science, NUS在 comp.nus.edu.sg 的电子邮件经过验证
Siddharth S BhandariTTIC, UChicago在 uchicago.edu 的电子邮件经过验证
Oded GoldreichProfessor of Computer Science, Weizmann Institute of Science在 weizmann.ac.il 的电子邮件经过验证
Salil VadhanVicky Joseph Professor of Computer Science and Applied Mathematics, Harvard University在 g.harvard.edu 的电子邮件经过验证
Raghu MekaUniversity of California, Los Angeles在 cs.ucla.edu 的电子邮件经过验证
Adam KlivansProfessor of Computer Science, University of Texas at Austin在 cs.utexas.edu 的电子邮件经过验证
Sofya RaskhodnikovaBoston University在 bu.edu 的电子邮件经过验证
Mrinal KumarTata Institute of Fundamental Research, Mumbai在 tifr.res.in 的电子邮件经过验证
Sandeep JunejaTata Institute of Fundamental Research在 tifr.res.in 的电子邮件经过验证
David McAllesterProfessor, Toyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Nathan SrebroProfessor, TTIC and University of Chicago在 ttic.edu 的电子邮件经过验证
Amey BhangaleUniversity of California, Riverside在 cs.ucr.edu 的电子邮件经过验证
Girish VarmaIIIT, Hyderabad在 iiit.ac.in 的电子邮件经过验证
Sharad ShriramGoogle Research India在 google.com 的电子邮件经过验证
Rajesh SundaresanECE and Centre for Cyber-Physical Systems, Indian Institute of Science在 iisc.ac.in 的电子邮件经过验证

关注

Prahladh Harsha

Tata Institute of Fundamental Research, Mumbai

在 tifr.res.in 的电子邮件经过验证 - 首页

Theoretical computer science computational complexity coding theory information theory


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
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	370	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	208	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	138	2005
Bounding the sensitivity of polynomial threshold functions P Harsha, A Klivans, R Meka arXiv preprint arXiv:0909.5175, 2009	73*	2009
Composition of low-error 2-query PCPs using decodable PCPs I Dinur, P Harsha SIAM Journal on Computing 42 (6), 2452-2486, 2013	65	2013
Boolean function analysis on high-dimensional expanders Y Dikstein, I Dinur, Y Filmus, P Harsha Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2018	51	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	45	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	39	2020
An invariance principle for polytopes P Harsha, A Klivans, R Meka Journal of the ACM (JACM) 59 (6), 1-25, 2013	39	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
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
Explicit SoS lower bounds from high-dimensional expanders I Dinur, Y Filmus, P Harsha, M Tulsiani arXiv preprint arXiv:2009.05218, 2020	25	2020
Minimizing average latency in oblivious routing. P Harsha, TP Hayes, H Narayanan, H Räcke, J Radhakrishnan SODA, 200-207, 2008	24	2008
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests I Dinur, Y Filmus, P Harsha Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019	22*	2019

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用