All talks are on Tuesdays at 4:15pm, in 32-155 on the 1st floor of Stata, unless otherwise stated.
Refreshments will be served before the lecture at 3:45pm in the RSA G5 Lounge .

Sep 9 Unusual location: 32-123	Bjorn Poonen, MIT/Math Undecidability in Number Theory
Sep 16	Yael Kalai, Microsoft Research New England Network Extractor Protocols
Sep 23	Alex Samorodnitsky, Hebrew University Linear Programming Bounds for Codes and Isoperimetry
Sep 30	Timothy Chow, Center for Communications Research, Princeton Almost-Natural Proofs
Oct 7	Fabian Kuhn, ETH Zurich The Price of Locality: Distributed Approximation Algorithms
Oct 14	Tim Roughgarden, Stanford From Bayesian to Worst-Case Optimal Auction Design
Oct 21	Gary Miller, Carnegie Mellon Meshing in Fixed Dimension in near Optimal Work and Time
Oct 28	FOCS: no talk
Nov 4	Alexander Sherstov, UT Austin The Pattern Matrix Method for Communication Lower Bounds
Nov 11	Veteran's Day: no talk
Nov 18	Zeev Dvir, IAS The finite field Kakeya conjecture and applications to explicit constructions of extractors
Dec 2	Luca Trevisan, UC Berkeley Max Cut and the Smallest Eigenvalue
Dec 9	Michael Mitzenmacher, Harvard Cuckoo Hashing and CAMs

For previous colloquiums, see the archives.

Questions? Contact toc-seminar-planners@lists.csail.mit.edu