Expanders, Property Testing and the PCP theorem

Student Presentations

Posted in annoucements, presentations by atri on November 9, 2008

Here is the schedule of the student presentation (all of them start at 10:30am in Bell 224):

  1. Yang (Nov 17): Towards 3-query locally decodable codes of subexponential length (Yekhanin)
  2. Nathan+Swapnoneel (Nov 21+24): Bounds on 2-query codeword testing (Ben-Sasson, Goldreich, Sudan).
  3. Steve (Dec 1)
  4. Than (Dec 5): Approximating the Minimum Spanning Tree Weight in Sublinear Time (Chazelle, Rubinfeld, Trevisan).

Please let us know once you choose your paper and we will update the list above.

Leave a Reply