Theory Colloquium Fall 2007
Scott Aaronson , MIT, CSAIL
A New Barrier in Complexity Theory
Date: September 11 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Yishay Mansour , Tel Aviv University
The Communication Complexity of Uncoupled Nash Equilibrium Procedures
Date: September 18 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Michael Kearns , University of Pennsylvania
Behavioral Games on Networks
Date: September 25 2007
Time: 4:15PM to 5:45PM
Location: 32-141 * NOTE NEW ROOM *
Devavrat Shah , MIT, LIDS
Scheduling in "switched" networks
Date: October 2 2007
Time: 4:15PM to 5:15PM
Location: 32--155
Umesh Vazirani , UC Berkeley
Expander Flows, Graph Spectra and Graph Separators
Date: October 30 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Nancy Lynch , MIT, CSAIL
[Knuth Prize Lecture] Distributed Computing Theory: Algorithms, Impossibility Results, Models, and Proofs
Date: November 6 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Kamal Jain , Microsoft Research
Atomic Economics
Date: November 13 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Russell Impagliazzo , IAS and UCSD
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
Date: November 20 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Aviv Regev , Broad Institute of MIT and Harvard
Automatic genome-wide reconstruction of phylogenetic gene trees
Date: November 27 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Ryan O'Donnell , CMU
3-Query Dictator Testing
Date: December 4 2007
Time: 4:15PM to 5:15PM
Location: 32-155
James R. Lee , University of Washington
Expander codes, distortion, and pseudorandom subspaces
Date: December 11 2007
Time: 4:15PM to 5:15PM
Location: 32-155
Back to Previous Series List
Back to Event Calendar