Prahladh Harsha
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
27
Venues
7
Active years
2001–2026
Best venue rank
A*
Where they publish
Papers
27 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | STOC | Deterministic List Decoding of Reed-Solomon Codes. | Soham Chatterjee, Mrinal Kumar, Prahladh Harsha |
| 2025 | ISAAC | Optimal Online Bipartite Matching in Degree-2 Graphs. | Amey Bhangale, Arghya Chakraborty, Prahladh Harsha |
| 2024 | FOCS | Dot-Product Proofs and Their Applications. | Nir Bitansky, Prahladh Harsha, Yuval Ishai, Ron D. Rothblum, David J. Wu |
| 2024 | FOCS | Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes. | Rohan Goyal, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar |
| 2024 | FOCS | An Improved Line-Point Low-Degree Test. | Prahladh Harsha, Mrinal Kumar, Ramprasad Saptharishi, Madhu Sudan |
| 2023 | FOCS | Fast Numerical Multivariate Multipoint Evaluation. | Sumanta Ghosh, Prahladh Harsha, Simao Herdade, Mrinal Kumar, Ramprasad Saptharishi |
| 2023 | SODA | Algorithmizing the Multiplicity Schwartz-Zippel Lemma. | Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Ashutosh Shankar |
| 2021 | STOC | Decoding multivariate multiplicity codes on product sets. | Siddharth Bhandari, Prahladh Harsha, Mrinal Kumar, Madhu Sudan |
| 2020 | FOCS | Rigid Matrices From Rectangular PCPs or: Hard Claims Have Complex Proofs. | Amey Bhangale, Prahladh Harsha, Orr Paradise, Avishay Tal |
| 2019 | SODA | Analyzing Boolean functions on the biased hypercube via higher-dimensional agreement tests: [Extended abstract]. | Irit Dinur, Yuval Filmus, Prahladh Harsha |
| 2019 | SODA | List Decoding with Double Samplers. | Irit Dinur, Prahladh Harsha, Tali Kaufman, Inbal Livni Navon, Amnon Ta-Shma |
| 2017 | STACS | On Polynomial Approximations Over Z/2^kZ*. | Abhishek Bhrushundi, Prahladh Harsha, Srikanth Srinivasan |
| 2016 | ICALP | Partition Bound Is Quadratically Tight for Product Distributions. | Prahladh Harsha, Rahul Jain, Jaikumar Radhakrishnan |
| 2015 | STOC | Polynomially Low Error PCPs with polyloglog n Queries via Modular Composition. | Irit Dinur, Prahladh Harsha, Guy Kindler |
| 2015 | STACS | Derandomized Graph Product Results Using the Low Degree Long Code. | Irit Dinur, Prahladh Harsha, Srikanth Srinivasan, Girish Varma |
| 2014 | STOC | Super-polylogarithmic hypergraph coloring hardness via low-degree long codes. | Venkatesan Guruswami, Prahladh Harsha, Johan Hstad, Srikanth Srinivasan, Girish Varma |
| 2011 | STOC | Almost settling the hardness of noncommutative determinant. | Steve Chien, Prahladh Harsha, Alistair Sinclair, Srikanth Srinivasan |
| 2010 | STOC | Bounding the average sensitivity and noise sensitivity of polynomial threshold functions. | Ilias Diakonikolas, Prahladh Harsha, Adam R. Klivans, Raghu Meka, Prasad Raghavendra, Rocco A. Servedio, Li-Yang Tan |
| 2010 | STOC | An invariance principle for polytopes. | Prahladh Harsha, Adam R. Klivans, Raghu Meka |
| 2009 | FOCS | Composition of Low-Error 2-Query PCPs Using Decodable PCPs. | Irit Dinur, Prahladh Harsha |
| 2008 | ICALP | Sound 3-Query PCPPs Are Long. | Eli Ben-Sasson, Prahladh Harsha, Oded Lachish, Arie Matsliah |
| 2008 | SODA | Minimizing average latency in oblivious routing. | Prahladh Harsha, Thomas P. Hayes, Hariharan Narayanan, Harald Rcke, Jaikumar Radhakrishnan |
| 2008 | UAI | Complexity of Inference in Graphical Models. | Venkat Chandrasekaran, Nathan Srebro, Prahladh Harsha |
| 2004 | ICALP | Communication Versus Computation. | Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Nissim, Srinivasan Venkatesh |
| 2004 | STOC | Robust pcps of proximity, shorter pcps and applications to coding. | Eli Ben-Sasson, Oded Goldreich, Prahladh Harsha, Madhu Sudan, Salil P. Vadhan |
| 2003 | STOC | Some 3CNF properties are hard to test. | Eli Ben-Sasson, Prahladh Harsha, Sofya Raskhodnikova |
| 2001 | STACS | Small PCPs with Low Query Complexity. | Prahladh Harsha, Madhu Sudan |