Theory tea reading group
The Theory Tea reading group meets once per week to discuss current topics in theory of computation. The format and subject matter vary depending on the tastes of the current participants, as channeled, Rousseau-style, through the Theory Tea Czar. The current Czar is Sam Hopkins, capably assisted by Thodoris Lykouris and Daniel Freund.
This semester, students will talk about some interesting/neat results related to their own (prior or current) work. This can, but don't have to, be their own results!
Currently, we plan the following: - Wednesday, 5-6 pm - Introductory talks, assuming only basic knowledge of TCS, highlighting the underlying motivation of a result/proof technique/future work/... in the area. - Snacks & beverages (provided funding)
While there may be exceptions, in general there should not be any required reading/preparation for the talks (i.e.: the talks will be self-contained!).
|September 10||Thodoris||Submodularity of Influence in Social Networks|
|October 1||No Theory Tea (CS 50th Anniversary)||No Theory Tea|
|October 28 (3:30pm)||Alice||TBA|
Discussion Area -- Feel Free to Edit
Sign your comments with this string of characters on the edit page:
Spectral graph theory
Dan Spielman's notes here: http://www.cs.yale.edu/homes/spielman/561/
Analysis of boolean functions
Ryan O'Donnell's book here: http://analysisofbooleanfunctions.org/
- I'd like to know more about fourier analysis and polynomials in this context. --Jshi (talk) 16:13, 19 November 2013 (EST)
- Ditto. Reitblatt (talk) 17:08, 19 November 2013 (EST)
Error-correcting codes and PCPs