Difference between revisions of "CATS"
From Theory
Line 24: | Line 24: | ||
| Nov 8|| 1:00-2:00 PM|| CSIC1122|| David Harris || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-8-2013 Partial Resampling in the Moser-Tardos Framework] | | Nov 8|| 1:00-2:00 PM|| CSIC1122|| David Harris || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-8-2013 Partial Resampling in the Moser-Tardos Framework] | ||
|- | |- | ||
− | | Nov 15|| 1:00-2:00 PM|| CSIC1122|| [http://mhbateni.com/academic/ Mohammad Hossein Bateni] || [ | + | | Nov 15|| 1:00-2:00 PM|| CSIC1122|| [http://mhbateni.com/academic/ Mohammad Hossein Bateni] || [https://wiki.cs.umd.edu/theory/index.php?title=CATS-Nov-15-2013 oncise Bid Optimization Strategies with Multiple Budget Constraints] |
|- | |- | ||
| Nov 22|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.umd.edu/~gasarch/ William Gasarch] || Pretty good, though still Exponetial, algorithms for 3-SAT and Min Ind Set | | Nov 22|| 1:00-2:00 PM|| CSIC1122|| [http://www.cs.umd.edu/~gasarch/ William Gasarch] || Pretty good, though still Exponetial, algorithms for 3-SAT and Min Ind Set |
Revision as of 02:20, 13 November 2013
Capital Area Theory Seminar[edit]
Fall 2013[edit]
Summer 2013[edit]
Date | Time | Location | Speaker | Title |
---|---|---|---|---|
Aug 2 | 1:00-2:00 PM | AVW4172 | Hubert Chan | Revisiting the Ranking Algorithm for Greedy Randomized Matching on Arbitrary Graphs |
CATS Talks from previous semesters[edit]
- Spring 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