| Line 2: |
Line 2: |
| | | | |
| | | | |
| − | ==Fall 2015 == | + | ==Spring 2017 == |
| | {| class="wikitable" style="text-align: center;" border="1" | | {| class="wikitable" style="text-align: center;" border="1" |
| | |- | | |- |
| | ! 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 |
| | |- | | |- |
| − | | Aug 3|| 11:00 AM-12:00 PM|| CSIC 1121|| [http://www.cs.nyu.edu/spencer/ Joel Spencer] || Finding Needles in Exponential Haystacks | + | | Feb 3, Feb 10|| 1:00 PM-2:00 PM|| CSIC 3118|| [https://karthikabinavs.xyz Karthik A Sankararaman] || Introduction to Sum-of-Squares (Reading from lecture notes by Boaz Barak) |
| | + | |- |
| | + | | Feb 17|| 1:00 PM-2:00 PM|| AVW 3258|| [http://www.cs.princeton.edu/~kothari/ Pravesh Kothari] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-17-2017 Approximate Constraint Satisfaction Requires Sub-exponential Size Linear Programs] |
| | + | |- |
| | + | | Feb 24|| 1:00 PM-2:00 PM|| CSIC 3118|| Tongyang Li || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-24-2017 Classical and quantum query complexity of entropy estimation] |
| | + | |- |
| | + | | March 3|| 1:00 PM-2:00 PM|| CSIC 3118|| Ahmed Abdelkader ||Max-Cut algorithm using SoS (Reding from lecture notes by Boaz Barak) |
| | + | |- |
| | + | | March 10|| 1:00 PM-2:00 PM|| CSIC 3118|| Aditya Acharya || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-10-2017 Hadwiger Debrunner problem on convex sets, and a special case] |
| | + | |- |
| | + | | March 17|| 1:00 PM-2:00 PM|| CSIC 3118|| || Special CATS session for visit day |
| | + | |- |
| | + | | March 31|| 12:00PM-1:00PM || AVW 3258 || Khoa Trinh || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-31-2017 Approximation Algorithms for Facility Location and Clustering Problems ( Dissertation Defense)] |
| | |- | | |- |
| − | | Sept 11|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~manishp/ Manish Purohit] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-10-2015 Approximation Algorithms for Connected Maximum Cut and Related Problems]
| |
| | |} | | |} |
| | + | |
| | + | Access a google calendar for this series at: https://calendar.google.com/calendar/embed?src=d58efrcl8l81c4utn77s88fijs%40group.calendar.google.com&ctz=America/Toronto |
| | | | |
| | == CATS Talks from previous semesters == | | == CATS Talks from previous semesters == |
| − | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2015 Spring 2015] | + | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2016 Spring 2016] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2016 Fall 2016] |
| | + | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2015 Spring 2015] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2015 Fall 2015] |
| | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2014 Spring 2014] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2014 Fall 2014] | | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2014 Spring 2014] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2014 Fall 2014] |
| | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2013 Spring 2013] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Summer-2013 Summer 2013] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2013 Fall 2013] | | * [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Spring-2013 Spring 2013] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Summer-2013 Summer 2013] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2013 Fall 2013] |