Prahladh Harsha

ScholarGPS® ID: 34367892830632

Affiliation

Tata Institute of Fundamental Research, Mumbai, India

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Food Coloring | Information Theory

Metrics Summary

Publication Count

Predicted Citations

1,122

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
Boolean Function Analysis on High-Dimensional Expanders (journal article) Dikstein, Yotam \| Dinur, Irit \| Filmus, Yuval \| Harsha, Prahladh Combinatorica, volume 44, issue 3, pages 563-620 (2024). 10.1007/s00493-024-00084-5 Cite \| Source
Rigid Matrices from Rectangular PCPs (journal article) Bhangale, Amey \| Harsha, Prahladh \| Paradise, Orr \| Tal, Avishay SIAM Journal on Computing, volume 53, issue 2, pages 480-523 (2024). 10.1137/22M1495597 Cite \| Source
Ideal-Theoretic Explanation of Capacity-Achieving Decoding (journal article) Bhandari, Siddharth \| Harsha, Prahladh \| Kumar, Mrinal \| Sudan, Madhu IEEE Transactions on Information Theory, volume 70, issue 2, pages 1107-1123 (2024). 10.1109/TIT.2023.3345890 Cite \| Source
Decoding Multivariate Multiplicity Codes on Product Sets (journal article) Bhandari, Siddharth \| Harsha, Prahladh \| Kumar, Mrinal \| Sudan, Madhu IEEE Transactions on Information Theory, volume 70, issue 1, pages 154-169 (2024). 10.1109/TIT.2023.3306849 Cite \| Source
Fast Numerical Multivariate Multipoint Evaluation (conference) Ghosh, Sumanta \| Harsha, Prahladh \| Herdade, Simao \| Kumar, Mrinal \| Saptharishi, Ramprasad 2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS) (2023) Santa Cruz, CA, USA 10.1109/FOCS57990.2023.00088 Cite \| Source
On the probabilistic degree of OR over the reals (journal article) Bhandari, Siddharth \| Harsha, Prahladh \| Molli, Tulasimohan \| Srinivasan, Srikanth Random Structures & Algorithms, volume 59, issue 1, pages 53-67 (2021). 10.1002/rsa.20991 Cite \| Source
Decoding multivariate multiplicity codes on product sets (conference) Bhandari, Siddharth \| Harsha, Prahladh \| Kumar, Mrinal \| Sudan, Madhu STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing (2021) Virtual Italy 10.1145/3406325.3451027 Cited by (1) \| Cite \| Source
List-Decoding with Double Samplers (journal article) Dinur, Irit \| Harsha, Prahladh \| Kaufman, Tali \| Navon, Inbal Livni \| Ta-Shma, Amnon SIAM Journal on Computing, volume 50, issue 2, pages 301-349 (2021). 10.1137/19M1276650 Cited by (5) \| Cite \| Source
City-Scale Agent-Based Simulators for the Study of Non-pharmaceutical Interventions in the Context of the COVID-19 Epidemic (journal article) Agrawal, Shubhada \| Bhandari, Siddharth \| Bhattacharjee, Anirban \| Deo, Anand \| Dixit, Narendra M. \| Harsha, Prahladh \| Juneja, Sandeep \| Kesarwani, Poonam \| Swamy, Aditya Krishna \| Patil, Preetam \| ... \| Yasodharan, Sarath Journal of the Indian Institute of Science, volume 100, issue 4, pages 809-847 (2020). 10.1007/s41745-020-00211-3 Cited by (16) \| Cite \| Source
On polynomial approximations to AC (journal article) Harsha, Prahladh \| Srinivasan, Srikanth Random Structures & Algorithms, volume 54, issue 2, pages 289-303 (2019). 10.1002/rsa.20786 Cited by (5) \| Cite \| Source \| Open Access
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract] (book chapter) In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms Dinur, Irit \| Filmus, Yuval \| Harsha, Prahladh Society for Industrial and Applied Mathematics (2019) 10.1137/1.9781611975482.128 Cited by (6) \| Cite \| Source
List Decoding with Double Samplers (book chapter) In Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms Dinur, Irit \| Harsha, Prahladh \| Kaufman, Tali \| Navon, Inbal Livni \| Shma, Amnon Ta Society for Industrial and Applied Mathematics (2019) 10.1137/1.9781611975482.129 Cited by (12) \| Cite \| Source
Robust Multiplication-Based Tests for Reed–Muller Codes (journal article) Harsha, Prahladh \| Srinivasan, Srikanth IEEE Transactions on Information Theory, volume 65, issue 1, pages 184-197 (2019). 10.1109/TIT.2018.2863713 Cited by (1) \| Cite \| Source \| Open Access
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes (journal article) Guruswami, Venkatesan \| Harsha, Prahladh \| Håstad, Johan \| Srinivasan, Srikanth \| Varma, Girish SIAM Journal on Computing, volume 46, issue 1, pages 132-159 (2017). 10.1137/140995520 Cited by (3) \| Cite \| Source \| Open Access
Robust Multiplication-Based Tests for Reed-Muller Codes (conference) Harsha, Prahladh \| Srinivasan, Srikanth Foundations of Software Technology and Theoretical Computer Science (2016) 10.4230/LIPIcs.FSTTCS.2016.17 Cited by (1) \| Cite \| Source
Partition Bound Is Quadratically Tight for Product Distributions (conference) Harsha, Prahladh \| Jain, Rahul \| Radhakrishnan, Jaikumar International Colloquium on Automata, Languages and Programming (2016) Rome 10.4230/LIPIcs.ICALP.2016.135 Cited by (1) \| Cite \| Source
On Polynomial Approximations to AC 0 (conference) Harsha, Prahladh \| Srinivasan, Srikanth International Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2016) 10.4230/LIPIcs.APPROX-RANDOM.2016.32 Cited by (4) \| Cite \| Source
Locally Testable Codes (book chapter) In Encyclopedia of Algorithms Harsha, Prahladh Springer New York (2016) 10.1007/978-1-4939-2864-4_707 Cite \| Source
A characterization of hard-to-cover CSPs (conference) Bhangale, Amey \| Harsha, Prahladh \| Varma, Girish Conference on Computational Complexity (2015) 10.4230/LIPIcs.CCC.2015.280 Cite \| Source
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition (conference) Dinur, Irit \| Harsha, Prahladh \| Kindler, Guy STOC '15: Symposium on Theory of Computing (2015) Portland Oregon USA 10.1145/2746539.2746630 Cited by (6) \| Cite \| Source \| Open Access