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] || TBA
+
| Sept 11|| 1:00-2:00 PM|| CSIC3120|| [http://www.cs.umd.edu/~manishp/ Manish Purohit] || Approximation Algorithms for Connected Maximum Cut and Related Problems
 
|}
 
|}
  

Revision as of 16:57, 10 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

CATS Talks from previous semesters[edit]