Prahladh Harsha

ORCID

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 87

Top Venues

CoRR

Electron. Colloquium Comput. Complex.

APPROX-RANDOM

ITCS

Massachusetts Institute of Technology, Cambridge, MA, USA (PHD)

Education History

Massachusetts Institute of Technology, Cambridge, MA, USA

PHD

Publications

Nir Bitansky, Ron D. Rothblum, Prahladh Harsha, Yuval Ishai, David J. Wu
Dot-Product Proofs and Their Applications. Electron. Colloquium Comput. Complex. (2024)
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Boolean Function Analysis on High-Dimensional Expanders. Comb. 44 (3) (2024)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding Multivariate Multiplicity Codes on Product Sets. IEEE Trans. Inf. Theory 70 (1) (2024)
Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu
Dot-Product Proofs and Their Applications. IACR Cryptol. ePrint Arch. 2024 (2024)
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
Rigid Matrices from Rectangular PCPs. SIAM J. Comput. 53 (2) (2024)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. IEEE Trans. Inf. Theory 70 (2) (2024)
Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. Electron. Colloquium Comput. Complex. (2023)
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
An Improved Line-Point Low-Degree Test. CoRR (2023)
Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar
Criticality of AC⁰-Formulae. CCC (2023)
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. Electron. Colloquium Comput. Complex. (2023)
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
Downward Self-Reducibility in TFNP. ITCS (2023)
Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Fast list-decoding of univariate multiplicity and folded Reed-Solomon codes. CoRR (2023)
Sumanta Ghosh, Prahladh Harsha, Simão Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. CoRR (2023)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. SODA (2023)
Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan
An Improved Line-Point Low-Degree Test. Electron. Colloquium Comput. Complex. (2023)
Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi
Fast Numerical Multivariate Multipoint Evaluation. FOCS (2023)
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
Downward Self-Reducibility in TFNP. Electron. Colloquium Comput. Complex. (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. Electron. Colloquium Comput. Complex. (2022)
Amey Bhangale, Prahladh Harsha, Sourya Roy
Mixing of 3-Term Progressions in Quasirandom Groups. ITCS (2022)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. Theory Comput. 18 (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CoRR (2022)
Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar
formulae. CoRR (2022)
Prahladh Harsha, Tulasimohan Molli, Ashutosh Shankar
Criticality of AC0-Formulae. Electron. Colloquium Comput. Complex. (2022)
Siddharth Bhandari, Prahladh Harsha, Ramprasad Saptharishi, Srikanth Srinivasan
Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes. CCC (2022)
Prahladh Harsha, Daniel Mitropolsky, Alon Rosen
Downward Self-Reducibility in TFNP. CoRR (2022)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the probabilistic degree of OR over the reals. Random Struct. Algorithms 59 (1) (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, A. Shankar
Algorithmizing the Multiplicity Schwartz-Zippel Lemma. Electron. Colloquium Comput. Complex. 28 (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-theoretic Explanation of Capacity-achieving Decoding. CoRR (2021)
Amey Bhangale, Prahladh Harsha, Sourya Roy
Mixing of 3-term progressions in Quasirandom Groups. CoRR (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding multivariate multiplicity codes on product sets. STOC (2021)
Amey Bhangale, Prahladh Harsha, Sourya Roy
Mixing of 3-term progressions in Quasirandom Groups. Electron. Colloquium Comput. Complex. 28 (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-theoretic Explanation of Capacity-achieving Decoding. Electron. Colloquium Comput. Complex. 28 (2021)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List-Decoding with Double Samplers. SIAM J. Comput. 50 (2) (2021)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Ideal-Theoretic Explanation of Capacity-Achieving Decoding. APPROX-RANDOM (2021)
Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Explicit SoS Lower Bounds from High-Dimensional Expanders. ITCS (2021)
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs. FOCS (2020)
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
Locally testable codes via high-dimensional expanders. Electron. Colloquium Comput. Complex. 27 (2020)
Prahladh Harsha, Sandeep Juneja, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, A. Y. Sarath, Sharad Sriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan
COVID-19 Epidemic Study II: Phased Emergence From the Lockdown in Mumbai. CoRR (2020)
Amey Bhangale, Prahladh Harsha, Girish Varma
A Characterization of Hard-to-Cover CSPs. Theory Comput. 16 (2020)
Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Explicit SoS lower bounds from high-dimensional expanders. CoRR (2020)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. APPROX-RANDOM (2020)
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
Rigid Matrices From Rectangular PCPs. CoRR (2020)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding Multivariate Multiplicity Codes on Product Sets. CoRR (2020)
Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal
Rigid Matrices From Rectangular PCPs. Electron. Colloquium Comput. Complex. 27 (2020)
Shubhada Agrawal, Siddharth Bhandari, Anirban Bhattacharjee, Anand Deo, Narendra M. Dixit, Prahladh Harsha, Sandeep Juneja, Poonam Kesarwani, Aditya Krishna Swamy, Preetam Patil, Nihesh Rathod, Ramprasad Saptharishi, Sharad Shriram, Piyush Srivastava, Rajesh Sundaresan, Nidhin Koshy Vaidhiyan, Sarath Yasodharan
City-Scale Agent-Based Simulators for the Study of Non-Pharmaceutical Interventions in the Context of the COVID-19 Epidemic. CoRR (2020)
Irit Dinur, Yuval Filmus, Prahladh Harsha, Madhur Tulsiani
Explicit and structured sum of squares lower bounds from high dimensional expanders. Electron. Colloquium Comput. Complex. 27 (2020)
Siddharth Bhandari, Prahladh Harsha
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. CoRR (2020)
Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan
Decoding Multivariate Multiplicity Codes on Product Sets. Electron. Colloquium Comput. Complex. 27 (2020)
Siddharth Bhandari, Prahladh Harsha
A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet. Electron. Colloquium Comput. Complex. 27 (2020)
Yotam Dikstein, Irit Dinur, Prahladh Harsha, Noga Ron-Zewi
Locally testable codes via high-dimensional expanders. CoRR (2020)
Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari
Improved 3LIN Hardness via Linear Label Cover. APPROX-RANDOM (2019)
Prahladh Harsha, Srikanth Srinivasan
Robust Multiplication-Based Tests for Reed-Muller Codes. IEEE Trans. Inf. Theory 65 (1) (2019)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List Decoding with Double Samplers. SODA (2019)
Prahladh Harsha, Srikanth Srinivasan
On polynomial approximations to AC. Random Struct. Algorithms 54 (2) (2019)
Prahladh Harsha, Subhash Khot, Euiwoong Lee, Devanathan Thiruvenkatachari
Improved 3LIN Hardness via Linear Label Cover. Electron. Colloquium Comput. Complex. 26 (2019)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Noga Ron-Zewi
From Local to Robust Testing via Agreement Testing. ITCS (2019)
Prahladh Harsha, Ramprasad Saptharishi
A note on the elementary HDX construction of Kaufman-Oppenheim. CoRR (2019)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. SODA (2019)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the Probabilistic Degree of OR over the Reals. CoRR (2018)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the Probabilistic Degree of OR over the Reals. Electron. Colloquium Comput. Complex. 25 (2018)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. CoRR (2018)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List Decoding with Double Samplers. CoRR (2018)
Abhishek Bhrushundi, Prahladh Harsha, Pooya Hatami, Swastik Kopparty, Mrinal Kumar
On Multilinear Forms: Bias, Correlation, and Tensor Rank. Electron. Colloquium Comput. Complex. 25 (2018)
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Boolean Function Analysis on High-Dimensional Expanders. APPROX-RANDOM (2018)
Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma
List Decoding with Double Samplers. Electron. Colloquium Comput. Complex. 25 (2018)
Siddharth Bhandari, Prahladh Harsha, Tulasimohan Molli, Srikanth Srinivasan
On the Probabilistic Degree of OR over the Reals. FSTTCS (2018)
Irit Dinur, Yotam Dikstein, Yuval Filmus, Prahladh Harsha
Boolean function analysis on high-dimensional expanders. Electron. Colloquium Comput. Complex. 25 (2018)
Yotam Dikstein, Irit Dinur, Yuval Filmus, Prahladh Harsha
Boolean functions on high-dimensional expanders. CoRR (2018)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Low degree almost Boolean functions are sparse juntas. CoRR (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Agreement tests on graphs and hypergraphs. Electron. Colloquium Comput. Complex. 24 (2017)
Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes. SIAM J. Comput. 46 (1) (2017)
Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
Z. CoRR (2017)
Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
ℤ. Electron. Colloquium Comput. Complex. 24 (2017)
Prahladh Harsha
Special Issue: CCC 2016: Guest Editor's Foreword. Theory Comput. 13 (1) (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Low degree almost Boolean functions are sparse juntas. Electron. Colloquium Comput. Complex. 24 (2017)
Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan
On Polynomial Approximations Over Z/2^kZ*. STACS (2017)
Irit Dinur, Yuval Filmus, Prahladh Harsha
Agreement tests on graphs and hypergraphs. CoRR (2017)
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
Multiplayer Parallel Repetition for Expanding Games. ITCS (2017)
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
Multiplayer parallel repetition for expander games. CoRR (2016)
Prahladh Harsha, Srikanth Srinivasan
On Polynomial Approximations to ${AC}^0$. CoRR (2016)
Prahladh Harsha, Srikanth Srinivasan
Robust Multiplication-Based Tests for Reed-Muller Codes. FSTTCS (2016)
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
Partition Bound Is Quadratically Tight for Product Distributions. ICALP (2016)
Prahladh Harsha, Srikanth Srinivasan
Robust Multiplication-based Tests for Reed-Muller Codes. CoRR (2016)
Irit Dinur, Prahladh Harsha, Rakesh Venkat, Henry Yuen
Multiplayer parallel repetition for expander games. Electron. Colloquium Comput. Complex. 23 (2016)
Amit Deshpande, Prahladh Harsha, Rakesh Venkat
Embedding Approximately Low-Dimensional l_2^2 Metrics into l_1. FSTTCS (2016)
Prahladh Harsha, Srikanth Srinivasan
Robust Multiplication-based Tests for Reed-Muller Codes. Electron. Colloquium Comput. Complex. 23 (2016)
Prahladh Harsha, Srikanth Srinivasan
On Polynomial Approximations to AC^0. APPROX-RANDOM (2016)
Irit Dinur, Prahladh Harsha, Guy Kindler
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. STOC (2015)
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
Relaxed partition bound is quadratically tight for product distributions. Electron. Colloquium Comput. Complex. 22 (2015)
Irit Dinur, Prahladh Harsha, Guy Kindler
Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. CoRR (2015)
Irit Dinur, Prahladh Harsha, Guy Kindler
Polynomially Low Error PCPs with polyloglogn Queries via Modular Composition. Electron. Colloquium Comput. Complex. 22 (2015)
Amey Bhangale, Prahladh Harsha, Girish Varma
A Characterization of Hard-to-cover CSPs. Computational Complexity Conference (2015)
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
Derandomized Graph Product Results Using the Low Degree Long Code. STACS (2015)
Amit Deshpande, Prahladh Harsha, Rakesh Venkat
. CoRR (2015)
Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan
Relaxed partition bound is quadratically tight for product distributions. CoRR (2015)
Prahladh Harsha, Adam R. Klivans, Raghu Meka
Bounding the Sensitivity of Polynomial Threshold Functions. Theory Comput. 10 (2014)
Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma
Derandomized Graph Product Results using the Low Degree Long Code. CoRR (2014)
Amey Bhangale, Prahladh Harsha, Girish Varma
A Characterization of hard-to-cover CSPs. CoRR (2014)
Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. STOC (2014)
Venkatesan Guruswami, Prahladh Harsha, Johan Håstad, Srikanth Srinivasan, Girish Varma
Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. Electron. Colloquium Comput. Complex. 20 (2013)

Prahladh Harsha.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Prahladh Harsha