Difference between revisions of "CATS"

From Theory
 
(42 intermediate revisions by the same user not shown)
Line 2: Line 2:
  
  
==Spring 2016 ==
+
==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
 
|-
 
|-
| Feb 5|| 1:00 AM-2:00 PM|| CSIC 2107|| [https://sites.google.com/site/panxupi/ Pan Xu] || Stochastic Knapsack Problem
+
| 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 12|| 1:00-2:00 PM|| CSIC 2107|| Paul Randazzo || On Polynomial Time algorithms for restricted Subset Sum Problems
+
| 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 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]
 
|-
 
| 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]
 
 
|-
 
|-
| 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]
+
| 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 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]
+
| 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 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]
+
| 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 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]
+
| March 17|| 1:00 PM-2:00 PM|| CSIC 3118|| || Special CATS session for visit day
 
|-
 
|-
| 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]
+
| 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)]
 
|-
 
|-
| April 15|| 1:00-2:00 PM|| CSIC 2107|| Saba Ahmadi || TBA
 
|-
 
| April 22|| 1:00-2:00 PM|| CSIC 2107|| Ahmed Abdelkader || TBA
 
|-
 
| April 29|| 1:00-2:00 PM|| CSIC 2107|| Yang Sheng || TBA
 
|-
 
| May 6|| 1:00-2:00 PM|| CSIC 2107|| [http://www.cs.umd.edu/~kabinav Karthik Abinav Sankararaman] || TBA
 
 
|}
 
|}
 +
 +
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-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-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]

Latest revision as of 14:55, 16 March 2017

Capital Area Theory Seminar[edit]

Spring 2017[edit]

Date Time Location Speaker Title
Feb 3, Feb 10 1:00 PM-2:00 PM CSIC 3118 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 Pravesh Kothari Approximate Constraint Satisfaction Requires Sub-exponential Size Linear Programs
Feb 24 1:00 PM-2:00 PM CSIC 3118 Tongyang Li 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 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 Approximation Algorithms for Facility Location and Clustering Problems ( Dissertation Defense)

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[edit]