Algorithms and Complexity Series 2006/2007
For more information on this series please see http://theory.csail.mit.edu/~madhu/algcompsem.html
Piotr Indyk , MIT CSAIL
Uncertainty Principles, Extractors, and Explicit Embeddings of L2 into L1
Date: February 15 2007
Time: 4:00PM to 5:15PM
Location: 32-G575
Jon Feldman , Google Research
Algorithmic Issues in Internet Search Advertising
Date: February 21 2007
Time: 4:15PM to 5:15PM
Location: 32-G449/Patil Conference Room
Dan Gutfreund , Harvard
Designing Efficient Program Checkers by Delegating Their Work
Date: February 22 2007
Time: 4:00PM to 5:15PM
Location: 32-G575
Mohit Singh , CMU
Approximating Minimum Bounded Degree Spanning Trees to within one of Optimal
Date: March 8 2007
Time: 4:00PM to 5:15PM
Location: 32-G575
Alexandr Andoni , MIT CSAIL
Lower Bounds for Edit Distance Estimation
Date: March 22 2007
Time: 4:00PM to 5:15PM
Location: 32-G575
Petar Maymounkov , MIT CSAIL
Geometric Routing, Embeddings and Hyperbolic Spaces
Date: April 12 2007
Time: 4:00PM to 5:15PM
Location: 32-G575
Kyomin Jung , MIT
**CANCELLED** Approximate Inference Algorithms
Date: April 19 2007
Time: 4:00PM to 5:15AM
Location: 32-G575
Kyomin Jung , MIT
Approximation algorithms for doubling dimensional metric spaces
Date: May 10 2007
Time: 4:00PM to 5:15PM
Location: 32-G575
Wojciech Szpankowski , Purdue University
Analytic Algorithmics, Combinatorics, And Information Theory
Date: September 15 2006
Time: 2:00PM to 3:15PM
Location: 32-G575
Nick Harvey , MIT CSAIL
The Conjugate Gradient Method with Automatic Preconditioning
Date: September 18 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Dana Ron , Tel Aviv University
Approximating the distance to properties in sparse graphs
Date: September 25 2006
Time: 4:00PM to 5:30PM
Location: 32-G575 (Theory Lab)
Evdokia Nikolova , MIT CSAIL
CANCELLED: Stochastic Shortest Paths via Quasi-Convex Maximization
Date: October 2 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Aranyak Mehta , IBM Almaden Research Center
Design is as Easy as Optimization
Date: October 16 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Nir Halman , MIT
Fully Polynomial Time Approximation Schemes for Convex and for Monotone Stochastic Dynamic Programming
Date: October 30 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Sidharth Jaggi , MIT LIDS
Fighting Byzantine Adversaries in Networks: Network Error-Correcting Codes
Date: November 6 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Sergey Yekhanin , MIT CSAIL
New Locally Decodable Codes and Private Information Retrieval Schemes
Date: November 13 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Vitaly Feldman , Harvard University
On Computational Hardness of Agnostic Learning
Date: November 27 2006
Time: 4:00PM to 5:30AM
Location: 32-G575 (Theory Lab)
Vitaly Feldman , Harvard
On Computational Hardness of Agnostic Learning
Date: November 27 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Julia Chuzhoy , IAS
Cut Problems in Graphs: Algorithms and Complexity
Date: December 4 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
Ning Xie , MIT
Testing k-wise and Almost k-wise Independence
Date: December 11 2006
Time: 4:00PM to 5:15PM
Location: 32-G575
For more information on this series please see http://theory.csail.mit.edu/~madhu/algcompsem.html
Back to Previous Series List
Back to Event Calendar
