|
- |
Avrim Blum | The value of strong inapproximability results for clique . |
|
- |
Bjarni Halldorsson | Approximating maximum independent sets by excluding subgraphs . |
|
- |
Rohit Khandekar | Randomized Metarounding . |
|
- |
Nicholas Hopper | Resettable zero-knowledge |
|
- |
Amitabh Sinha | The small-world phenomenon: an algorithmic perspective . |
|
- |
John Langford | Quantum Error checking . |
|
- |
Martin Zinkevich | Random walks with back buttons . | 9/20
Wednesday |
Adam Kalai | Noise-Tolerant Learning, the Parity Problem, and the Statistical Query Model. |
| 9/27
Wednesday |
- | No Theory Lunch |
| 10/4
Wednesday |
Ke Yang | The Stable Circuit Problem |
| 10/11
Wednesday |
Rachel Rue | The Stable Circuit Problem (Part 2) |
| 11/8
Wednesday |
Jochen Konemann | Approximation algorithms for 2-metric network design |
| 11/29
Wednesday |
Sorin Istrail | Discussion: Computational Biology |
| 12/6
Wednesday |
Lisa Fleischer | On submodular function minimization (part 1) |
| 12/13
Wednesday |
Lisa Fleischer | On submodular function minimization (part 2) |
| last update: Nov. 11, 2001 | maintained by Bartosz Przydatek (bartosz@cs.cmu.edu) |