Publications of Prahladh Harsha

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

Research Papers

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