|
Theory Seminar & talks
2009-2010 Academic Year
|
Recent |
Event / Seminar |
Wednesday October 28, 2009 |
Theory Seminar
Satisfiability Allows No
Nontrivial Sparsification Unless The Polynomial-Time
Hierarchy Collapses
Dieter van Melkebeek
4pm, 3310 CS
|
Wednesday October 14, 2009 |
Theory Seminar
Region growing for multi-route cuts
Siddharth Barman
4pm, 3310 CS
|
Wednesday September 30, 2009 |
Theory Seminar
Satisfiability Allows No
Nontrivial Sparsification Unless The Polynomial-Time
Hierarchy Collapses
Dieter van Melkebeek
4pm, 3310 CS
|
Thursday September 24, 2009 |
Theory Seminar
Multi-armed Bandits with Side Constraints
Kamesh Munagala, Duke University
4pm, 3310 CS (Cookies: 3:45pm)
|
Monday September 14, 2009 |
Theory Seminar
Holant problems, CSP and graph homomorphisms---An overview
Jin-Yi Cai
4:00pm, 4310 CS
|
Wednesday September 9, 2009 |
Theory Seminar
Simple vs. Optimal Auctions
Jason Hartline, Northwestern University
2:30pm, 3310 CS (Cookies: 2:15pm)
|
Monday August 31, 2009 |
Theory Seminar
Differentially Private Approximation Algorithms
Kunal Talwar, Microsoft Research
4pm, 4310 CS (Cookies: 3:45pm)
|
| |
|
Mailing List
Announcements about the seminar are sent to
theory-seminar@cs.wisc.edu mailing list. Here are instructions on how to
subscribe
to and unsubscribe
from the list.
|