TOC Seminar Spring 2007

Feb 13

Madhu Sudan, MIT CSAIL 
Towards Universal Semantic Communication

Feb 20

Christos Papadimitriou, University of California at Berkeley 
The Complexity of Nash Equilibria

Feb 27

Joint TOC-LIDS Colloquium 
Silvio Micali, MIT CSAIL 
Perfect Achievement of Correlated Equilibrium 
LOCATION: 32-141

Mar 6

Martin Farach-Colton, Rutgers University 
Strings in the Memory Hierarchy

Mar 13

Anup Rao, UT Austin 
Extracting pure randomness from multiple impure sources of randomness

Mar 20

Salil Vadhan, Harvard University 
Expander Graphs, Randomness Extractors, and List-Decodable Codes

Mar 27

No TOC Colloquium: Spring Break

Apr 3

Nina Amenta, University of California at Davis 
Delaunay triangulations of points on manifolds

Apr 10

Bernard Chazelle, Princeton University 
Data-Powered Algorithms

Apr 17

No TOC Colloquium: Patriots Day

Apr 24

No TOC Colloquium

May 1

Ueli Maurer, ETH Zurich 
Abstract models of computation and complexity lower bounds 
Unusual TIME: 4pm

May 8

Assaf Naor, Courant Institute of Mathematical Sciences, NYU 
Algorithmic Fourier Inversion 
Unusual LOCATION: 3-270

May 15

Maurice Herlihy, Brown University 
Subconsensus Tasks: Renaming is Weaker than Set Agreement