Difference between revisions of "CATS"

From Theory
 
(9 intermediate revisions by the same user not shown)
Line 2: Line 2:
  
  
−
==Fall 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
 
|-
 
|-
−
| 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 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)
 
|-
 
|-
−
| 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 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]
 
|-
 
|-
−
| 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 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]
 
|-
 
|-
−
| 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 3|| 1:00 PM-2:00 PM|| CSIC 3118|| Ahmed Abdelkader ||Max-Cut algorithm using SoS (Reding from lecture notes by Boaz Barak)
 
|-
 
|-
−
| 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 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]
 
|-
 
|-
−
| 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 17|| 1:00 PM-2:00 PM|| CSIC 3118|| || Special CATS session for visit day
 
|-
 
|-
−
| 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 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)]
−
|-
 
−
| 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
 
 
|-
 
|-
 
|}
 
|}

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]

Web Accessibility

Retrieved from "https://wiki.cs.umd.edu/theory/w/index.php?title=CATS&oldid=2128"