1. The Communication Complexity of Correlation.
  2. Short PCPs verifiable in polylogarithmic time.
  3. Communication vs. Computation.
  4. Robust PCPs of proximity, shorter PCPs and applications to coding.
  5. Some 3CNF properties are hard to test.
  6. Small PCPs with low query complexity.

Prahladh Harsha
Valid HTML 4.01! Valid CSS! Get Firefox!