Difference between revisions of "CATS-Fall-2016"
From Theory
(Created page with "==Fall 2016 == {| class="wikitable" style="text-align: center;" border="1" |- ! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speak...") |
|||
| Line 4: | Line 4: | ||
! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title | ! width="70pt" | Date !! width="110pt" | Time !! width="70pt" | Location !! width="150pt" | Speaker !! width="580pt" | Title | ||
|- | |- | ||
| − | | | + | | Sept 9|| 1:00 PM-2:00 PM|| CSIC 2107|| [https://karthikabinavs.xyz 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|| [http://pha.jhu.edu/~lyang/ Lin Yang] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-23-2016 Streaming Symmetric Norms via Measure Concentration] |
| − | |||
|- | |- | ||
| − | | | + | | Sept 30|| 1:00 PM-2:00 PM|| CSIC 2107|| [https://www.cs.umd.edu/users/mount/ Dave Mount] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-30-2016 Low Complexity Convex Approximation] |
|- | |- | ||
| − | | | + | | Oct 6|| 1:00PM - 2:00PM || AVW 4172 || [https://scholar.google.com/citations?user=t3kDJHQAAAAJ&hl=en Michael Cohen] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-6-2016 Computing the Stationary Distribution] |
|- | |- | ||
| − | | | + | | Oct 7|| 11:00AM - 12:00PM || CSIC 2117 || [http://www.immorlica.com/ Nicole Immorlica] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-7-2016 The emergent structure of simple behaviors in complex networks] |
|- | |- | ||
| − | | | + | | Oct 13|| 1:00PM - 2:00 PM || AVW 3258 || [https://barnasaha.net/ Barna Saha] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-13-2016 Language Edit Distance, (min,+)-Matrix Multiplication & Beyond] |
|- | |- | ||
| − | | | + | | Oct 21|| 1:00 PM - 2:00 PM || CSIC 2107 || [http://people.seas.harvard.edu/~jthaler/ Justin Thaler] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-21-2016 Approximate Degree, Sign-Rank, and the Method of Dual Polynomials] |
|- | |- | ||
| − | | | + | | Oct 28 || 1:00 PM - 2:00 PM || CSIC 2107 || [https://www.microsoft.com/en-us/research/people/slivkins/ Alex Slivkins] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Oct-28-2016 Bandits and agents: How to incentivize exploration?] |
|- | |- | ||
| − | | | + | | Nov 4 || 1:00 PM - 2:00 PM || CSIC 2107 || [https://www.cs.umd.edu/users/gasarch/ Bill Gasarch] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-4-2016 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 || [http://www.cs.umd.edu/~khoa/ Khoa Trinh] || TBA | ||
|- | |- | ||
| − | |||
|} | |} | ||
Revision as of 15:53, 1 February 2017
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 | TBA |
