Difference between revisions of "CATS"

From Theory
 
(136 intermediate revisions by 3 users not shown)
Line 2: Line 2:
  
  
−
== Spring 2014 ==
+
==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
 
|-
 
|-
−
| Jan 17|| 1:00-2:00 PM|| AVW4172|| [http://sina.sharif.edu/~emahmood/ E.S. Mahmoodian] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Jan-17-2014 Defining sets in combinatorics with emphasis in graph theory]
+
| 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)
 
|-
 
|-
−
| Jan 31|| 1:00-2:00 PM|| CSIC3120|| [https://www.cs.umd.edu/people/mabolhas Melika Abolhassani] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Jan-31-2014 Selling Tomorrow's Bargains Today]
+
| 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 7|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~rchitnis/ Rajesh Chitnis] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-7-2014 Beating 2^n: Faster Exact Algorithms for Some Graph Problems]  
+
| 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]
 
|-
 
|-
−
| Feb 14|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~hossein/Research.html Hossein Esfandiari] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-14-2014  Online Stochastic Reordering Buffer Scheduling] 
+
| March 3|| 1:00 PM-2:00 PM|| CSIC 3118|| Ahmed Abdelkader ||Max-Cut algorithm using SoS (Reding from lecture notes by Boaz Barak)
 
|-
 
|-
−
| Feb 21|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~khani/ Reza Khani]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-21-2014 Revenue Monotone Mechanisms for Online Advertising]  
+
| 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]
 
|-
 
|-
−
| Feb 28|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~manishp/ Manish Purohit]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Feb-28-2014 On Correcting Inputs - Inverse Optimization with a Margin]
+
| March 17|| 1:00 PM-2:00 PM|| CSIC 3118|| || Special CATS session for visit day
 
|-
 
|-
−
| Mar 7|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~kasarpa/Welcome.html Kanthi Kiran Sarpatwar]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-7-2014 Analyzing the Optimal Neighborhood: Algorithms for Partial and Budgeted Connected Dominating Set Problems]
+
| 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)]
−
|-
 
−
| Mar 14|| 1:00-2:00 PM|| CSIC3120|| [http://onak.pl/ Krzysztof Onak]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-14-2014  Parallel Algorithms for Geometric Graph Problems]
 
 
|-
 
|-
−
| Mar 28|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~hmahini/ Hamid Mahini]|| [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-28-2014 How to Influence People with Partial Incentives]
 
−
|-
 
−
| Apr 2|| 1:00-2:00 PM|| AVW3258|| [http://www.cs.rutgers.edu/~szegedy/ Mario Szegedy] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-2-2014 Impossibility Theorems and the Universal Algebraic Toolkit]
 
−
|-
 
−
| Apr 4|| 1:00-2:00 PM|| CSIC3120|| [http://terpconnect.umd.edu/~raghavan/ S. Raghu Raghavan] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-4-2014 Weighted and Fractional Versions of the Target Set Selection Problem on Trees]
 
−
|-
 
−
| Apr 11|| 1:00-2:00 PM|| CSIC1115|| [http://www.cs.toronto.edu/~bor/ Allan Borodin] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-11-2014 Greedy-like algorithms and a myopic model for the non-monotone submodular maximization problem]
 
−
|-
 
−
| Apr 18|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.jhu.edu/~mdinitz/ Michael Dinitz] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-18-2014 Label Cover Instances with Large Girth and the Hardness of Approximating Spanners]
 
−
|-
 
−
| May 2|| 1:00-2:00 PM|| CSIC1115|| [https://sites.google.com/site/quaerereverum9/ Rakesh Vohra] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-May-2-2014 One-Sided Matching with Limited Complementarities]
 
−
|-
 
−
| May 9|| 1:00-2:00 PM|| CSIC3120|| [http://www.math.uwaterloo.ca/~lsanita/ Laura Sanita] || TBA
 
 
|}
 
|}
  
−
(*) Sponsored by CS Dept and Northrop Grumman.
+
Access a google calendar for this series at: https://calendar.google.com/calendar/embed?src=d58efrcl8l81c4utn77s88fijs%40group.calendar.google.com&ctz=America/Toronto
−
 
 
−
(**)
 
−
Supported in part by NSF CAREER award 1053605, NSF grant CCF-1161626, ONR YIP award N000141110662, DARPA/AFOSR grant FA9550-12-1-0423, and a grant from Simons Foundation.
 
  
 
==  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-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]
 
* [http://www.cs.umd.edu/areas/Theory/CATS/catss12.html Spring 2012] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2012 Fall 2012]
 
* [http://www.cs.umd.edu/areas/Theory/CATS/catss12.html Spring 2012] [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Fall-2012 Fall 2012]

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"