| Spring 2008 |
|
Updated 5/8/07 |
|
When / Where |
Speaker / Title |
Host |
Friday
January 25
3:30 pm
Wean Hall 7220 |
Sofya Raskhodnikova, Penn State
Approximating String Compressibility and the Distribution Support
Size
(abstract)
|
Ryan O'Donnell |
Friday
February 1
***11:00 am***
**NSH 1305** |
Ivet Bahar, University of Pittsburgh
Supramolecular Machinery: Insights from Elastic Network Models
(abstract)
***Note the unusual time and location***
|
Gary Miller |
Friday
February 1
3:30 pm
Wean Hall 7220 |
Jiri Sgall, Mathematical Institute, Academy of Sciences of the Czech Republic
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
(abstract)
|
Steven Rudich |
Friday
February 15
3:30 pm
Wean Hall 7220 |
Kamesh Munagala, Duke
LP-duality Based Algorithms for Restless Bandit Problems
(abstract)
|
Anupam Gupta |
Friday
February 22
3:30 pm
Wean Hall 7220 |
Bardia Sadri, Duke
I/O-Efficient Algorithms for Computing Contour Lines on a Terrain
(abstract) |
Gary Miller |
Friday
February 29
3:30 pm
Wean Hall 7220 |
Prahladh Harsha, TTI Chicago
Sound 3-query PCPPs are long
(abstract)
|
Ryan O'Donnell |
Friday
March 14
3:30 pm
Wean Hall 7220 |
Spring
Break (No Theory Seminar) |
|
Friday
March 28
3:30 pm
Wean Hall 7220 |
Open House |
|
Friday
April 18
3:30 pm
Wean Hall 7220 |
Benoit Hudson, TTI
What makes a good Steiner point
(abstract) |
Gary Miller |
Friday
April 25
3:30 pm
Wean Hall 7220 |
Pall Melsted, CMU
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
(abstract) |
Alan Frieze |
Friday
May 2
3:30 pm
**Wean Hall 7500** |
Vijay Vazirani, Georgia Tech
Nash Bargaining via Flexible Budget Markets
(abstract)
**Note unusual room** |
Manuel Blum |
CENTER
Carnegie
Mellon 
Aladdin
