CATS-Fall-2016
From Theory
Revision as of 15:54, 1 February 2017 by Karthikabinav (talk | contribs)
Fall 2016[edit]
| Date | Time | Location | Speaker | Title |
|---|---|---|---|---|
| Sept 9 | 1:00 PM-2:00 PM | CSIC 2107 | Karthik A Sankararaman | Convex Optimization in Small Dimensions (Reading from lecture notes by Sebastien Bubeck) |
| Sept 23 | 1:00 PM-2:00 PM | CSIC 2107 | Lin Yang | Streaming Symmetric Norms via Measure Concentration |
| Sept 30 | 1:00 PM-2:00 PM | CSIC 2107 | Dave Mount | Low Complexity Convex Approximation |
| Oct 6 | 1:00PM - 2:00PM | AVW 4172 | Michael Cohen | Computing the Stationary Distribution |
| Oct 7 | 11:00AM - 12:00PM | CSIC 2117 | Nicole Immorlica | The emergent structure of simple behaviors in complex networks |
| Oct 13 | 1:00PM - 2:00 PM | AVW 3258 | Barna Saha | Language Edit Distance, (min,+)-Matrix Multiplication & Beyond |
| Oct 21 | 1:00 PM - 2:00 PM | CSIC 2107 | Justin Thaler | Approximate Degree, Sign-Rank, and the Method of Dual Polynomials |
| Oct 28 | 1:00 PM - 2:00 PM | CSIC 2107 | Alex Slivkins | Bandits and agents: How to incentivize exploration? |
| Nov 4 | 1:00 PM - 2:00 PM | CSIC 2107 | Bill Gasarch | The Muffin Problem |
| Nov 11 | 1:00 PM - 2:00 PM | CSIC 2107 | Hadi Yami | Leximin Allocations in the Real World (Paper presentation) |
| Nov 18 | 1:00 PM - 2:00 PM | CSIC 2107 | Sheng Yang | Revisiting Connected Dominating Sets: An Optimal Local Algorithm? |
| Dec 2 | 1:00 PM - 2:00 PM | CSIC 2107 | Aravind Srinivasan | Correlation inequalities and the Group Steiner Tree problem |
| Dec 9 | 1:00 PM - 2:00 PM | CSIC 2107 | Khoa Trinh | The Minimum Bounded Degree Matroid Basis problem |
