Difference between revisions of "CATS"

From Theory
Line 9: Line 9:
 
| Aug 3|| 11:00 AM-12:00 PM|| CSIC 1121|| [http://www.cs.nyu.edu/spencer/ Joel Spencer] || Finding Needles in Exponential Haystacks  
 
| Aug 3|| 11:00 AM-12:00 PM|| CSIC 1121|| [http://www.cs.nyu.edu/spencer/ Joel Spencer] || Finding Needles in Exponential Haystacks  
 
|-
 
|-
| 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]  
+
| Sept 11|| 1:00-2:00 PM|| CSIC3118|| [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]  
 
|-
 
|-
| Sept 25|| 1:00-2:00 PM|| CSIC3120|| [http://karthikabinavs.xyz Karthik A Sankararaman] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-25-2015 Lassere Hierarchy]  
+
| Sept 25|| 1:00-2:00 PM|| CSIC3118|| [http://karthikabinavs.xyz Karthik A Sankararaman] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Sept-25-2015 Lassere Hierarchy]  
 
|}
 
|}
  

Revision as of 16:05, 21 September 2015