Theory Colloquium Spring 2006
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Piotr Indyk , Massachusetts Institute of Technology
Near-Optimal Hashing Algorithm for the Approximate Nearest Neighbor Problem
Date: February 14 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Nir Shavit , Tel Aviv University
Virtual Leashing: Internet-Based Software Piracy
Date: February 21 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Robert Gallager , Massachusetts Institute of Technology
The Impact of Information Theory on Information Technology
Date: February 28 2006
Time: 4:15PM to 5:15PM
Location: 32-155 (refreshments in RSA G5 Lounge)
Michael Krivelevich , Tel Aviv University
Property Testing in Graphs of General Density
Date: March 7 2006
Time: 4:15PM to 5:15PM
Location: 4-237 (refreshments in RSA G5 Lounge)
Avrim Blum , Carnegie Mellon University
On Decision-Making Without Regret, Routing Games, and Convergence to Equilibria
Date: March 14 2006
Time: 4:15PM to 5:15PM
Location: 32-155 (refreshments in RSA G5 Lounge)
Leslie Valiant , Harvard University
A Quantitative Theory of Neural Computation
Date: March 21 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Moses Charikar , Princeton University
Near-Optimal Algorithms for Unique Games
Date: April 4 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Venkat Guruswami , University of Washington
Capacity-Achieving List Decodable Codes for Worst-Case Errors
Date: April 11 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Leonard Schulman , California Institute of Technology
Error-Correcting Codes for Automatic Control
Date: April 25 2006
Time: 4:15PM to 5:15PM
Location: 32-155
Erik Demaine , Massachusetts Institute of Technology
Linkage Folding: From Steam Engines to Proteins
Date: May 2 2006
Time: 4:15PM to 5:15PM
Location: RSA lounge, then talk in 6-120
Tali Kaufman , Massachusetts Institute of Technology
Property Testing of Codes - Results, Methods and Limitations
Date: May 8 2006
Time: 4:15PM to 5:15PM
Location: 32-G575 (Theory Lab)
Subhash Khot , Georgia Institute of Technology
Lower Bounds for Approximating MAX-CUT and Sparsest Cut
Date: May 16 2006
Time: 4:15PM to 5:15PM
Location: 32-155
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Back to Previous Series List
Back to Event Calendar
