Publications of Prahladh Harsha

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

Research Papers

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