Publications of Prahladh Harsha

[ Papers | Surveys/Lecture Notes | Theses | Important Notes ]


In reverse chronological order.

  1. On polynomial approximations over Z/2^kZ
  2. Multiplayer parallel repetition for expander games
  3. Robust Multiplication-based Tests for Reed-Muller Codes
  4. Embedding Approximately Low Dimensional l2-squared metrics into l1
  5. On Polynomial Approximations to AC0
  6. Partition bound is quadratically tight for product distributions
  7. A Characterization of hard-to-cover CSPs
  8. Polynomially low error PCPs with polyloglog n queries via modular composition
  9. Derandomized Graph Product Results using the Low Degree Long Code
  10. Super-polylogarithmic hypergraph coloring hardness via low-degree long codes
  11. A strong direct product theorem for the tribes function via the smooth-rectangle bound
  12. Almost settling the hardness of noncommutative determinant
  13. An invariance principle for polytopes
  14. Bounding the sensitivity of polynomial threshold functions
  15. Composition of low-error 2-query PCPs using decodable PCPs
  16. Complexity of Inference in Graphical Models
  17. Sound 3-query PCPPs are Long
  18. Minimizing Average Latency in Oblivious Routing
  19. The communication complexity of correlation.
  20. Short PCPs verifiable in polylogarithmic time.
  21. Communication vs. Computation.
  22. Robust PCPs of proximity, shorter PCPs and applications to coding.
  23. Some 3CNF properties are hard to test.
  24. Lower bounds for bounded depth Frege proofs via Buss-Pudlák games.
  25. Small PCPs with low query complexity.
  26. Distributed processing in automata.

Surveys/Lecture Notes

  1. DIMACS Tutorial on "Limits of approximation algorithms : PCPs and Unique Games".
  2. CS369E: Expanders in Computer Science (Stanford University, Spring 2005).


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

Important Notes:

Prahladh Harsha
Valid HTML 4.01!