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