Difference between revisions of "Theory tea reading group"

From Cornell CS Wiki
Jump to: navigation, search
Line 1: Line 1:
Official website:
+
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.
 +
 
 +
Old website:
 
https://www.cs.cornell.edu/~samhop/theory_tea/current_tea.html
 
https://www.cs.cornell.edu/~samhop/theory_tea/current_tea.html
  
 +
= Fall 2014 =
 +
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!).
 +
 +
 +
== Schedule ==
 +
{| class="wikitable"
 +
|-
 +
! Date
 +
! Presenter
 +
! Topic
 +
|-
 +
| September 10
 +
| Thodoris
 +
| Submodularity of Influence in Social Networks
 +
|-
 +
| September 17
 +
| Emerson
 +
| TBA
 +
|-
 +
| September 24
 +
| TBA
 +
| TBA
 +
|-
 +
| October 1
 +
| No Theory Tea (CS 50th Anniversary)
 +
| No Theory Tea
 +
|-
 +
| October 8
 +
| Daniel
 +
| TBA
 +
|-
 +
| October 15
 +
| TBA
 +
| TBA
 +
|-
 +
| October 22
 +
| TBA
 +
| TBA
 +
|-
 +
| October 28 (3:30pm)
 +
| Alice
 +
| TBA
 +
|-
 +
| November 5
 +
| Pooya
 +
| TBA
 +
|-
 +
| November 12
 +
| Hedyeh
 +
| TBA
 +
|-
 +
| November 19
 +
| Rahmtin
 +
| TBA
 +
|-
 +
| November 26
 +
| Eoin
 +
| TBA
 +
|}
 +
 +
 +
= Discussion Area -- Feel Free to Edit =
 
= Possible topics =
 
= Possible topics =
 
Sign your comments with this string of characters on the edit page:  
 
Sign your comments with this string of characters on the edit page:  

Revision as of 15:49, 3 September 2014

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.

Old website: https://www.cs.cornell.edu/~samhop/theory_tea/current_tea.html

Fall 2014

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!).


Schedule

Date Presenter Topic
September 10 Thodoris Submodularity of Influence in Social Networks
September 17 Emerson TBA
September 24 TBA TBA
October 1 No Theory Tea (CS 50th Anniversary) No Theory Tea
October 8 Daniel TBA
October 15 TBA TBA
October 22 TBA TBA
October 28 (3:30pm) Alice TBA
November 5 Pooya TBA
November 12 Hedyeh TBA
November 19 Rahmtin TBA
November 26 Eoin TBA


Discussion Area -- Feel Free to Edit

Possible topics

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/

In favor:

  • Jshi (talk) 16:13, 19 November 2013 (EST)
  • Df365 (talk) 22:55, 19 November 2013 (EST)

Analysis of boolean functions

Ryan O'Donnell's book here: http://analysisofbooleanfunctions.org/

In favor:

  • 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

i.e. http://arxiv.org/abs/1111.0405

In favor:

  • Jshi (talk) 16:13, 19 November 2013 (EST)


Quantum computing

I can lead one or two survey discussions on this topic. --Jshi (talk) 16:13, 19 November 2013 (EST)

  • I would love that! I wanted to take the class in the spring, but won't due to the clash with Approx - so would be a big supporter of that idea as well! --Df365 (talk) 22:55, 19 November 2013 (EST)