Carnegie Mellon University, School of Computer Science

Theory Lunch

Theory Lunch is an informal seminar run by Algorithms and Complexity Theory Group on Wednesdays, noon till 1pm, in NSH 1507 (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 and exciting open problems, etc.

Fall 2005 Schedule

(Wednesdays noon-1:00pm, NSH 1507)

TIME SPEAKER TITLE
September 14, Wednesday David Abraham Two-Sided Matching Markets with One-Sided Preferences
September 21, Wednesday Maverick Woo A Tale of Two Simple Data Structures
September 28, Wednesday Vincent Conitzer Computational Aspects of (Iterated) Dominance, Nash Equilibrium, and What Lies In-Between
October 5, Wednesday Lea Kissner Privacy-Preserving Set Operations
October 12, Wednesday Vineet Goyal How to Pay, Come What May: Approximation Algorithms for Demand-Robust Covering Problems
October 19, Wednesday Nina Balcan Mechanism Design via Machine Learning
October 26, Wednesday David S. Johnson Compressing Rectilinear Pictures, with Applications to the Internet
November 2, Wednesday Luis von Ahn Thesis Oral: Human Computation
Location: 3305 Newell-Simon Hall
November 9, Wednesday Andrew Gilpin Finding equilibria in large sequential games of imperfect information
November 16, Wednesday
No Theory Lunch
No Theory Lunch
November 23, Wednesday
No Theory Lunch
No Theory Lunch
November 30, Wednesday Virginia Vassilevska Models of Greedy Algorithms
December 7, Wednesday Hubert Chan Sparse Spanners for Doubling Metrics
Location: 3305 Newell-Simon Hall
December 14, Wednesday Daniel Golovin Strongly History Independent Hashing
Location: 1305 Newell-Simon Hall

Previous Seminar Series

maintained by Katrina Ligett (katrina+theorylunch@cs.cmu.edu)