*All seminars held in 5130 Upson Hall at 4:00 pm unless otherwise noted*
| Date & Time | Speaker | Title | Host |
| August 22, 2013 | Ola Svensson, EPFL | David Shmoys | |
August 28, 2013**** Wedenesday **** (Joint TCS/probability seminar) |
Dimitris Achlioptas, UC Santa Cruz | How to Get More Realistic Models of Random Networks | Bobby Kleinberg |
| September 2, 2013 | Labor Day, No Seminar | ||
September 9, 2013 (joint CS/Microeconomic Theory Seminar) |
Valerio Capraro, University of Southampton | A solution concept for games with altruism and cooperation | Joe Halpern |
| September 16, 2013 | Sidharth Telang, Cornell University | Knowledge Preserving Interactive Coding | n/a |
| September 23, 2013 | Greg Kuperberg, UC Davis | The computational complexity of geometric topology problems | Paul Ginsparg |
September 30, 2013 * Uris 498, 4:30pm * (Joint CS/Microeconomic theory seminar) |
Dov Samet, Tel Aviv University and Cornell University | Non-Bayesian Rationality | Larry Blume |
| October 7, 2013 | Aaron Sidford, MIT | An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations | Bobby Kleinberg |
| October 14, 2013 | Fall Break, no seminar | ||
| October 21, 2013 | Lior Seeman, Cornell University | Adaptive Seeding in Social Networks | n/a |
October 28, 2013 * Uris 498, 4:30pm * (Joint CS/Microeconomic theory seminar) |
Emerson Melo, Cornell University | Price Competition in Networked Markets of Complements and Substitutes | n/a |
November 5, 2013 - ADDITIONAL SEMINAR * Upson 5126, 12:00pm * **Please note this is a Tuesday |
Mark Braverman, Princeton | Optimal Provision-After-Wait in Healthcare | David Steurer |
November 5, 2013 **Please note this is a Tuesday 4:00pm ** |
Mark Braverman, Princeton | Information Complexity and Applications | David Steurer |
| November 11, 2013 | STOC Deadline, no seminar | ||
| November 18, 2013 | Brendan Lucier, Microsoft Research | Simple Prices for Complex Markets | Bobby Kleinberg |
| November 25, 2013 | Roy Schwartz, Microsoft Research | Simplex Partitioning via Exponential Clocks and the Multiway-Cut Problem | David Williamson |
| December 2, 2013 | David Steurer, Cornell University | Approximate Constraint Satisfaction Requires Large LP Relaxations |
n/a |
December 6, 2013 (Joint TCS/AI seminar) **5130 Upson Hall, 12:00pm** |
Adam Bjorndahl, Cornell University | Language-Based Games | Joe Halpern |
To receive email announcements about the Theory Seminar, subscribe to our mail mpr13@cornell.edu
The schedule of the theory seminar is also available as a Google
Calendar: [html], [ical]. (You can copy and paste the ical url into any calendar application that supports the ical format.)
Spring 2013 | Fall 2012 | Spring 2012 | Fall 2011 | Spring 2011 |
Fall 2010 | Spring
2010 | Fall 2009 |
Spring 2009 | Fall 2008 |
Spring 2008 |
Fall 2007 | Spring 2007
| Fall 2006