Difference between revisions of "Theory tea reading group"

From Cornell CS Wiki
Jump to: navigation, search
Line 36: Line 36:
| September 30 (Tuesday, 3.30pm)
| September 30 (Tuesday, 3.30pm)
| Rad Niazadeh
| Rad Niazadeh
| Price posting for selling a single item : a tight approximation to optimal revenue auction.
| Price posting for selling a single item: a tight approximation to optimal revenue auction.
| October 8
| October 8

Revision as of 11:51, 19 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!).


Date Presenter Topic
September 10 Thodoris Lykouris Submodularity of Influence in Social Networks
September 17 Emerson Melo Network games: theory and applications
September 24 Chaoxu Tong Capacitated Facility Location
September 30 (Tuesday, 3.30pm) Rad Niazadeh Price posting for selling a single item: a tight approximation to optimal revenue auction.
October 8 Soroush Alamdari A Non-Cooperative Game of Public Facilities on Networks
October 15 Daniel Freund Approximation algorithms for rank aggregation
October 22 TBA TBA
October 28 (Tuesday, 3:30pm) Alice Paul A Spectral Algorithm for Max Colored Cut and an application to MAX 2SAT
November 5 Pooya Jalaly Market Equilibrium
November 12 Hedyeh Beyhaghi TBA
November 19 Rahmtin Rotabi Behavioral Econ
November 26 Eoin O'Mahony 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)