Difference between revisions of "CATS"

From Theory
Line 22: Line 22:
 
|-
 
|-
 
| Mar 29|| 1:00-2:00 PM|| AVW2120|| [http://www.cs.umd.edu/~vliaghat/ Vahid Liaghat] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-29-2013 Improvements on Offline and Online Node-Weighted Steiner Connectivity Problems]  
 
| Mar 29|| 1:00-2:00 PM|| AVW2120|| [http://www.cs.umd.edu/~vliaghat/ Vahid Liaghat] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Mar-29-2013 Improvements on Offline and Online Node-Weighted Steiner Connectivity Problems]  
 +
|-
 +
| Apr 5|| 1:00-2:00 PM|| CSI3117|| [http://www.cs.umd.edu/~vliaghat/ Vahid Liaghat] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-05-2013 to be announced]
 
|-
 
|-
 
| Apr 12|| 1:00-2:00 PM|| CSI3117|| [http://www2.research.att.com/~dsj/ David Johnson] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-12-2013 The Combinatorics of Hidden Diversity]  
 
| Apr 12|| 1:00-2:00 PM|| CSI3117|| [http://www2.research.att.com/~dsj/ David Johnson] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Apr-12-2013 The Combinatorics of Hidden Diversity]  

Revision as of 19:43, 30 March 2013

Capital Area Theory Seminar[edit]

Spring 2013[edit]

Date Time Location Speaker Title
Jan 25 1:00-2:00 PM AVW4172 Morteza Monemizadeh Property Testing in Planar Graphs and Euclidean Facility Location in the Streaming Model
Feb 1 1:00-2:00 PM AVW2120 Reza Khani Movement Repairman Problem
Feb 15 1:00-2:00 PM AVW4172 David Malec Approximations in Bayesian optimal multi-dimensional mechanism design
Feb 22 1:00-2:00 PM AVW2120 Koyel Mukherjee To send or not to send: Reducing the cost of data transmission
Mar 1 1:00-2:00 PM AVW4172 Kanthi Kiran Sarpatwar New Approximation Results for Resource Replication Problems
Mar 8 1:00-2:00 PM AVW2120 Rajesh Chitnis New Connections between Fixed-Parameter Algorithms and Approximation Algorithms
Mar 15 1:00-2:00 PM AVW4172 Nicole Immorlica The Degree of Segregation in Social Networks
Mar 29 1:00-2:00 PM AVW2120 Vahid Liaghat Improvements on Offline and Online Node-Weighted Steiner Connectivity Problems
Apr 5 1:00-2:00 PM CSI3117 Vahid Liaghat to be announced
Apr 12 1:00-2:00 PM CSI3117 David Johnson The Combinatorics of Hidden Diversity
Apr 17 9:00-10:00 AM AVW4172 Howard J. Karloff Maximum Entropy Summary Trees
Apr 19 1:00-2:00 PM AVW4172 Evdokia Nikolova to be announced
Apr 26 1:00-2:00 PM AVW4172 Aravind Srinivasan The breakthrough on k-median by Li and Svensson
May 3 1:00-2:00 PM CSI3117 Tim Roughgarden Porting the Computer Science Toolbox to Game Theory and Economics
May 10 1:00-2:00 PM AVW4172 ALex Slivkins to be announced
May 13 1:00-2:00 PM AVW3258 Jochen Koenemann to be announced

(*) Sponsored by CS Dept and Northrop Grumman.

(**) 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[edit]

Web Accessibility

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