| Fall 2007 |
|
Updated 5/8/07 |
|
When / Where |
Speaker / Title |
Host |
Friday
September 7
3:30 pm
Wean Hall 7220 |
Ken Clarkson, Almaden Research Center, IBM Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm (abstract)
|
Anupam
Gupta |
Friday
September 14
3:30 pm
Wean Hall 7220 |
James Lee, University of Washington Expander codes and pseudorandom subspaces of R^n (abstract)
|
Ryan
O'Donnell |
Friday
September 21
3:30 pm
Wean Hall 7220 |
|
|
Friday
September 28
3:30 pm
Wean Hall 7220 |
Rahul Santhanam, Edinburgh/Toronto TBD
(abstract) (Talk postponed to Nov 2nd) |
Ryan O'Donnell |
Friday
October 5
3:30 pm
Wean Hall 7220 |
Nicole Immorlica, CWI/Northwestern Balloon Popping with Applications to Ascending Auctions
(abstract)
|
Ryan O'Donnell |
Friday
October 12
3:30 pm
Wean Hall 7220 |
Nick Harvey, MIT Query Lower Bounds for Matroids via Group Representations (abstract)
|
Anupam
Gupta |
Friday
October 19
3:30 pm
**Wean 5302** |
Fall
Break (No Theory Seminar) Also, Boris Pittel speaking at the ACO Seminar. |
|
Friday
October 26
3:30 pm
Wean Hall 7220 |
Sudipto Guha, UPenn Optimization and Approximation under Partial Information (abstract)
|
Anupam
Gupta |
***Tuesday*** ***October 30***
3:30 pm
Wean Hall 7220 |
Shahar Dobzinski, Hebrew University The Power of VCG: On Algorithms that are Maximal In Range (abstract)
|
Avrim Blum |
Friday
November 2
3:30 pm
Wean Hall 7220 |
Rahul Santhanam, Edinburgh/Toronto Infeasibility of Instance Compression and Succinct PCPs for NP
(abstract) |
Ryan O'Donnell |
Friday
November 9
3:30 pm
Wean Hall 7220 |
Scott Aaronson, MIT Algebrization: A New Barrier in Complexity Theory (abstract)
|
Ryan
O'Donnell |
Friday
November 16
3:30 pm
Wean Hall 7220 |
Danny Vilenchik, Tel Aviv Univ. Satisfiable k-CNF Distributions above the Threshold (abstract) (Joint Theory/ACO Seminar)
|
Alan Frieze |
Friday
November 23
3:30 pm
Wean Hall 7220 |
Thanksgiving
Break (No Theory Seminar) |
|
Friday
November 30
3:30 pm
Wean Hall 7220 |
Adam Kalai, Georgia Tech Efficient algorithms for agnostic learning (aka learning with
arbitrary noise) (abstract)
|
Ryan
O'Donnell |
Friday
December 7
3:30 pm
Wean Hall 7220 |
Chandra Chekuri, UIUC Algorithms for 2-Route Cut Problems (abstract)
|
Anupam
Gupta |