Theory Colloquium Fall 2005
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Eran Tromer , Weizmann Institute
Cryptanalysis through Memory Cache Address Leakage
Date: September 13 2005
Time: 4:15PM to 5:30PM
Location: 32-G449 (Kiva)
Ashish Goel , Stanford
Algorithmic Self-Assembly: Models and Problems
Date: September 20 2005
Time: 4:15PM to 5:30PM
Location: 32-G449 (Kiva)
Asaf Shapira , Tel Aviv University
TBA
Date: October 11 2005
Time: 4:15PM to 5:30PM
Location: 32-G449 (Kiva)
Asaf Shapira , Tel Aviv University
Theory Seminar
Date: October 18 2005
Time: 4:15PM to 5:15PM
Location: D463 (Star)
Rachid Guerraoui , EPFL/MIT
What is "hard" in distributed computing?
Date: October 25 2005
Time: 4:15PM to 5:15PM
Location: 32-G449 (Kiva)
Rocco Servedio , Columbia University
Learning Monotone Functions in Polynomial Time
Date: November 8 2005
Time: 4:15PM to 5:30PM
Location: G449 Patil/Kiva
Bobby Kleinberg , UC Berkeley and Cornell
Group-Theoretic Algorithms for Matrix Multiplication
Date: November 22 2005
Time: 4:15PM to 5:30PM
Location: G449 Patil/Kiva
Lisa Fleischer , IBM
Cost Shares and Approximation Algorithms for Network Design Problems
Date: November 30 2005
Time: 4:15PM to 5:15PM
Location: 32-G575 (Theory Lab)
Dan Gutfreund , Hebrew University
Recent results on worst-case to average-case reductions for NP
Date: December 6 2005
Time: 4:15PM to 5:30PM
Location: 32-G449 Patil/Kiva, Stata Ctr
Sanjeev Khanna , University of Pennsylvania
New Algorithms for Disjoint Paths Problems
Date: December 13 2005
Time: 4:15PM to 5:15PM
Location: 32-G449 (Kiva)
For more information on this series please see http://theory.csail.mit.edu/toc-seminars/
Back to Previous Series List
Back to Event Calendar
