| 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 |
| | |- | | |- |
| − | | Feb 5|| 1:00 AM-2:00 PM|| CSIC 2107|| [https://sites.google.com/site/panxupi/ Pan Xu] || Stochastic Knapsack Problem | + | | 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) |
| | |- | | |- |
| − | | Feb 12|| 1:00-2:00 PM|| CSIC 2107|| Paul Randazzo || On Polynomial Time algorithms for restricted Subset Sum Problems | + | | 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] |
| − | | |
| | |- | | |- |
| − | | Feb 19|| 1:00-2:00 PM|| CSIC 2107|| [http://www.csc.lsu.edu/~rahul/ Rahul Shah] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-19-2016 Succinct Data Structures and Text Indexing] | + | | 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] |
| | |- | | |- |
| − | | Feb 26|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.jhu.edu/~vova/ Vladimir Braverman] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-26-2016 New Streaming Methods for Heavy Hitters and Norms] | + | | 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] |
| | |- | | |- |
| − | | March 4|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.umd.edu/~bbrubach/ Brian Brubach] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-4-2016 Survey of Local Computation Algorithms] | + | | 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] |
| | |- | | |- |
| − | | March 11|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.umd.edu/~ioana/ Ioana bercea] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-9-2016 On Computing Maximal Independent Sets of Hypergraphs in Parallel] | + | | 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] |
| | |- | | |- |
| − | | March 16|| 1:00-2:00 PM || CSIC 2107 || [https://users.cs.duke.edu/~debmalya/ Debmalya Panigrahi] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-16-2016 Online Budgeted Allocation with General Budgets] | + | | 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] |
| | |- | | |- |
| − | | March 25|| 1:00-2:00 PM|| CSIC 2107|| [http://seas.yale.edu/faculty-research/faculty-directory/amin-karbasi Amin Karbasi] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-25-2016 Data Summarization at Scale] | + | | 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?] |
| | |- | | |- |
| − | | April 8|| 1:00-2:00 PM|| CSIC 2107|| [http://www.maa.org/fern-y-hunt Fern Hunt] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-8-2016 An Algorithm for Identifying Optimal Spreaders in a Random Walk Model of Network Communication] | + | | 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] |
| | |- | | |- |
| − | | April 15|| 1:00-2:00 PM|| CSIC 2107|| Saba Ahmadi || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-15-2016 Dynamic (1+\epsilon)-Approximate Matchings: A Density Sensitive Approach] | + | | Nov 11 || 1:00 PM - 2:00 PM || CSIC 2107 || Hadi Yami || Leximin Allocations in the Real World (Paper presentation) |
| | |- | | |- |
| − | | April 22|| 1:00-2:00 PM|| CSIC 2107|| Ahmed Abdelkader || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-22-2016 Approximating the ATSP on topologically restricted graphs] | + | | Nov 18 || 1:00 PM - 2:00 PM || CSIC 2107 || Sheng Yang || Revisiting Connected Dominating Sets: An Optimal Local Algorithm? |
| | |- | | |- |
| − | | April 29|| 1:00-2:00 PM|| CSIC 2107|| Yang Sheng || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-29-2016 An Improved Distributed Algorithm for Maximal Independent Set] | + | | 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 |
| | |- | | |- |
| − | | May 6|| 2:00-3:00 PM|| AVW 4424|| [http://www.cs.umd.edu/~kabinav Karthik Abinav Sankararaman] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-6-2016 Randomized Dependent Rounding of Linear Programs]
| |
| | |} | | |} |