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] || 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] |
|} | |} | ||
Revision as of 16:58, 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]
- Spring 2015
- Spring 2014 Fall 2014
- Spring 2013 Summer 2013 Fall 2013
- Spring 2012 Fall 2012
- Spring 2011 Fall 2011
- Spring 2010 Fall 2010
- Spring 2009
- Spring 2008 Fall 2008
- Spring 2007 Fall 2007
- Spring 2006 Fall 2006
- Spring 2005 Fall 2005
- Spring 2004 Fall 2004
- Spring 2003 Fall 2003
- Spring 2002 Fall 2002
- Fall 2001
- Spring 2000 Fall 2000
- Spring 1999 Fall 1999
- Spring 1998 Fall 1998
- Spring 1997 Fall 1997
- Spring 1996 Summer 1996 Fall 1996
- Fall 1995
