Skip to main content
MIT CSAIL Theory of Computation MIT CSAIL
  • Accessibility
  • login
  • home
    • About
    • TOC Calendar
    • Contact
  • People
    • Faculty
    • Research Scientists
    • lecturers
    • Postdocs
    • Students
    • Visitors
    • Support Staff
    • Alumni
  • Research Groups
    • Algorithms
    • Complexity Theory
      • Complexity Theory Courses
    • Computation and Economics
    • Cryptography and Information Security
    • Theory of Distributed Systems
    • Parallel Computing
      • Applied Computing
      • Supertech Research
    • Quantum Information Science
    • Computation & Biology
    • Computational Connectomics
    • Learning-Augmented Algorithms
    • Multicore Algorithmics
    • Sublinear Algorithms
    • Theory of Machine Learning
  • Seminars
    • Theory of Computation Colloquium
    • Algorithms and Complexity Seminars
    • Theory of Distributed Systems (TDS)
    • CRYPTOGRAPHY AND INFORMATION SECURITY (CIS) SEMINARS
    • Bioinformatics Seminars
    • TCS+
    • Theory Reading Group
  • Courses
    • Course Calendar
    • Course Descriptions
    • Who Is Teaching What (Fall 2024)
  • Miscellaneous
    • New Student Blog: Not so Great Ideas in Theoretical Computer Science
    • TOC People in the News: 2009-2012
    • Awards
    • Algorithms Office Hours
  • TOC in Pictures
    • People
    • Celebrations
    • Retreats
    • Corn Fest

TOC Seminar Fall 2008

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