Publications of Prahladh Harsha

[ Research Papers | Theses | Other Publications | Important Notes ]

Research Papers

  1. Fast list-decoding of univariate multiplicity and folded Reed-Solomon codesnew
  2. An Improved Line-Point Low-Degree Testnew
  3. Sparse juntas on the biased hypercubenew
  4. Dot-Product Proofs and Their Applicationsnew
  5. Fast Numerical Multivariate Multipoint Evaluation
  6. Criticality of AC0-Formulae
  7. Downward Self-Reducibility in TFNP
  8. Vanishing Spaces of Random Sets and Applications to Reed-Muller Codes
  9. Algorithmizing the Multiplicity Schwartz-Zippel Lemma
  10. Mixing of 3-term progressions in Quasirandom Groups
  11. Ideal-theoretic Explanation of Capacity-achieving codes
  12. Decoding Multivariate Multiplicity Codes on Product Sets
  13. City-Scale Agent-Based Simulators for the Study of Non-pharmaceutical Interventions in the Context of the COVID-19 Epidemic
  14. COVID-19 Epidemic in Mumbai: Projections, full economic opening, and containment zones versus contact tracing and testing: An Update
  15. Explicit SoS lower bounds from high-dimensional expanders
  16. COVID-19 Epidemic Study II: Phased Emergence from the Lockdown in Mumbai
  17. Locally testable codes via high-dimensional expanders
  18. Rigid Matrices from Rectangular PCPs or: Hard Claims Have Complex Proofs
  19. A note on the explicit constructions of tree codes over polylogarithmic-sized alphabet
  20. On the Elementary Construction of High-Dimensional Expanders by Kaufman and Oppenheim
  21. Improved Hardness for 3LIN via Linear Label Cover
  22. From Local Testing to Robust Testing via Agreement Testing
  23. On the Probabilistic Degree of OR over the Reals
  24. List Decoding with Double Samplers
  25. On Multilinear Forms: Bias, Correlation, and Tensor Rank
  26. Boolean function analysis on high-dimensional expanders
  27. Agreement tests on graphs and hypergraphs
  28. On polynomial approximations over Z/2^kZ
  29. Multiplayer parallel repetition for expander games
  30. Robust Multiplication-based Tests for Reed-Muller Codes
  31. Embedding Approximately Low Dimensional l2-squared metrics into l1
  32. On Polynomial Approximations to AC0
  33. Partition bound is quadratically tight for product distributions
  34. A Characterization of hard-to-cover CSPs
  35. Polynomially low error PCPs with polyloglog n queries via modular composition
  36. Derandomized Graph Product Results using the Low Degree Long Code
  37. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
  38. A strong direct product theorem for the tribes function via the smooth-rectangle bound
  39. Almost settling the hardness of noncommutative determinant
  40. An invariance principle for polytopes
  41. Bounding the sensitivity of polynomial threshold functions
  42. Composition of low-error 2-query PCPs using decodable PCPs
  43. Complexity of Inference in Graphical Models
  44. Sound 3-query PCPPs are Long
  45. Minimizing Average Latency in Oblivious Routing
  46. The communication complexity of correlation.
  47. Short PCPs verifiable in polylogarithmic time.
  48. Communication vs. Computation.
  49. Robust PCPs of proximity, shorter PCPs and applications to coding.
  50. Some 3CNF properties are hard to test.
  51. Lower bounds for bounded depth Frege proofs via Buss-Pudlák games.
  52. Small PCPs with low query complexity.
  53. Distributed processing in automata.

Theses

  1. Robust PCPs of Proximity and Shorter PCPs.
  2. Small PCPs with low query complexity.
  3. Distributed-Automata and Simple Test Tube Systems.

Other Publications (Surveys/Lecture Notes/Blogposts)

  1. The Blooming of the c3 LTC Flowers [blogpost]
  2. Sampling Spanning Trees using HDXs [exposition]
  3. Research Vignette: The Many Dimensions of High-Dimensional Expanders [blogpost]
  4. Locally testable codes [encyclopedia entry]
  5. DIMACS Tutorial on "Limits of approximation algorithms : PCPs and Unique Games" [lecture notes]
  6. CS369E: Expanders in Computer Science (Stanford University, Spring 2005) [lecture notes]

Important Notes:

Prahladh Harsha