Publications of Prahladh Harsha

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


In reverse chronological order.

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