Theory Lunch is an informal seminar run by the Algorithms and Complexity Theory Group. The seminar meets on Wednesdays, noon till 1pm, in GHC 6115 (unless otherwise specified). It is open to faculty, graduate and undergraduate students interested in theoretical aspects of Computer Science.
The meetings have various forms: talks on recently completed results, joint reading of an interesting paper, presentations of current work in progress, exciting open problems, etc. The talks are recorded and are available on the CMU Theory Youtube channel. The recordings for this semester are available on the playlist of Fall 2019 theory lunch videos.
If you are interested in giving a talk, please contact Ainesh Bakshi and Rajesh Jayaram.
If you would like to receive notifications for the talks, you can sign up for our mailing list.
- Fall 2000
- Spring 2001
- Fall 2001
- Spring 2002
- Fall 2002
- Spring 2003
- Fall 2003
- Spring 2004
- Fall 2004
- Spring 2005
- Fall 2005
- Spring 2006
- Fall 2006
- Spring 2007
- Fall 2007
- Spring 2008
- Fall 2008
- Spring 2009
- Fall 2009
- Spring 2010
- Fall 2010
- Spring 2011
- Fall 2011
- Spring 2012
- Fall 2012
- Spring 2013
- Fall 2013
- Spring 2014
- Fall 2014
- Spring 2015
- Fall 2015
- Spring 2016
- Fall 2016
- Spring 2017
- Fall 2017
- Spring 2018
- Fall 2018
- Spring 2019