Theory Colloquium 2009/2010
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Madhu Sudan , CSAIL, MIT
Semantic Goal-Oriented Communication
Date: February 2 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Christos Papadimitriou , UC Berkeley
Computing Nash equilibria: The plot thickens
Date: February 10 2010
Time: 1:00PM to 2:00PM
Location: 32-G449
Leonid Gurvits , Los Alamos National Laboratory
A story of one convex relaxation, and of the related revelation
Date: February 11 2010
Time: 1:30PM to 2:30PM
Location: 32-155
Vitaly Feldman , IBM Almaden
On the statistical query complexity of learning monotone functions
Date: February 25 2010
Time: 1:30PM to 2:30PM
Location: 32-D463 STAR conf rm
Avinatan Hassidim , RLE, MIT
Implementing Mechanisms
Date: March 2 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Nir Shavit , Tel-Aviv University and Sun Labs
Hashing and the New Multicore Algorithmics
Date: March 9 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Daron Acemoglu , Dept of Economics, MIT
Dynamic Coalition Formation
Date: March 30 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Avrim Blum , Carnegie Mellon University
A new theoretical framework for clustering
Date: April 6 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Anna Lubiw , University of Waterloo
Simultaneous Graph Problems
Date: April 13 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Jakob Nordstrom , MIT
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Date: April 20 2010
Time: 4:15PM to 5:15PM
Location: 32-155
David Staelin , EECS, MIT
Fast-learning neural models that maximize Shannon information storage
Date: April 27 2010
Time: 4:15PM to 5:15PM
Location: 32-155
David Steurer , Princeton University
Subexponential Algorithms for Unique Games and Related Problems
Date: May 4 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Jeffrey Shallit , University of Waterloo (visiting MIT)
Open Problems in Automata Theory and Formal Languages
Date: May 11 2010
Time: 4:15PM to 5:15PM
Location: 32-155
TBA ,
TOC Colloquium
Date: May 18 2010
Time: 4:15PM to 5:15PM
Location: 32-155
Or Meir , Weizmann Institute
PCPs of sub-constant error via derandomized direct product
Date: October 20 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Ariel Procaccia , Harvard U.
f(x) marks the spot
Date: November 3 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Christian Borgs , Microsoft Research New England
Search, Recommendations, and Spam
Date: November 10 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Rocco A. Servedio , Columbia University
Average Sensitivity of Polynomial Threshold Functions
Date: November 17 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Sanjeev Arora , Princeton University
Computational complexity and information asymmetry in financial derivatives
Date: November 24 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Ran Raz , Weizmann Institute
Locally Testable Codes Analogues to the Unique Games Conjecture Do Not Exist
Date: December 1 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Michel Goemans , MIT
Approximating the Asymmetric Traveling Salesman Problem
Date: December 8 2009
Time: 4:15PM to 5:15PM
Location: 32-155
Moni Naor , Weizmann Institute
Backyard Cuckoo Hashing: Constant Worst-Case Operations with a Succinct Representation
Date: December 15 2009
Time: 4:15PM to 5:15PM
Location: 32-G155
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Back to Previous Series List
Back to Event Calendar
