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.

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 | ||

November 23, Wednesday | ||

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 |

- Fall 2000
- Spring 2001
- Fall 2001
- Spring 2002
- Fall 2002
- Spring 2003
- Fall 2003
- Spring 2004
- Fall 2004
- Spring 2005

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