Prahladh Harsha

Employment

• Tata Institute of Fundamental Research
  2010 - Present

Education

• Massachusetts Institute of Technology PhD
• Indian Institute of Technology Madras BTech

Projects & Funding

Projects & funding information is unavailable.

Publications (51)

• Deterministic List Decoding of Reed-Solomon Codes
  2026 DOI: 10.1145/3798129.3800908
  +Save
• Algorithmizing the Multiplicity Schwartz-Zippel Lemma
  TheoretiCS 2025 DOI: 10.46298/theoretics.25.29
  +Save
• Sparse juntas on the biased hypercube
  TheoretiCS 2024 DOI: 10.46298/theoretics.24.18
  +Save
• Downward Self-Reducibility in TFNP
  Schloss Dagstuhl – Leibniz-Zentrum für Informatik 2023 DOI: 10.4230/lipics.itcs.2023.67
  +Save
• Improved 3LIN Hardness via Linear Label Cover
  LIPIcs 2019 DOI: 10.4230/lipics.approx-random.2019.9
  +Save
• On polynomial approximations to AC0
  Random Structures & Algorithms 2018 DOI: 10.1002/rsa.20786
  +Save
• Boolean function analysis on high-dimensional expanders
  Leibniz International Proceedings in Informatics, LIPIcs 2018 DOI: 10.4230/LIPIcs.APPROX-RANDOM.2018.38
  +Save
• Robust Multiplication-based Tests for Reed-Muller Codes
  IEEE Transactions on Information Theory 2018 DOI: 10.1109/TIT.2018.2863713
  +Save
• Super-Polylogarithmic Hypergraph Coloring Hardness via Low-Degree Long Codes
  SIAM Journal on Computing 2017 DOI: 10.1137/140995520
  +Save
• Guest editor’s foreword
  Theory of Computing 2017 DOI: 10.4086/toc.2017.v013a001
  +Save