Difference between revisions of "CATS"

From Theory
Line 10: Line 10:
 
|-
 
|-
 
| 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|| 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 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]
 
|}
 
|}
  

Revision as of 18:41, 18 September 2015

Capital Area Theory Seminar[edit]

Fall 2015[edit]

Date Time Location Speaker Title
Aug 3 11:00 AM-12:00 PM CSIC 1121 Joel Spencer Finding Needles in Exponential Haystacks
Sept 11 1:00-2:00 PM CSIC3120 Manish Purohit Approximation Algorithms for Connected Maximum Cut and Related Problems
Sept 25 1:00-2:00 PM CSIC3120 Karthik A Sankararaman Lassere Hierarchy

CATS Talks from previous semesters[edit]

Web Accessibility

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