Algorithms and Complexity Seminar: Fall
2006
Organizers:
Ronitt Rubinfeld and Madhu Sudan.
The Algorithms and Complexity seminar
for Fall 2006 will
meet Mondays 4pm-5:15pm in G575
(Theory Lab). The style and format of
these meetings
are quite variable. Please feel free to contact the host to find out
more details.
- Friday, September 15, 2006 at 2pm:
Note the unusual date and
time. Speaker: Wojciech Szpankowski (Purdue).
Topic: Analytic Algorithmics, Combinatorics, And
Information Theory. Host: Madhu Sudan.
- September 18, 2006:
Speaker: Nick Harvey (MIT
CSAIL). Topic: The Conjugate Gradient Method with
Automatic Preconditioning. Host: Madhu Sudan.
- September 25, 2006:
Speaker: Dana Ron (Tel Aviv
U.). Topic: Approximating
the distance
to properties in sparse graphs. Host: Ronitt Rubinfeld.
- October 2, 2006: CANCELLED.
- October 9, 2006: Columbus Day (MIT Holiday).
- October 16, 2006: Aranyak Mehta (Georgia Tech.).
Topic: Design
is as Easy as Optimization. Host: Ronitt Rubinfeld.
- October 23, 2006: No Seminar due to FOCS.
- October 30, 2006: Speaker: Nir Halman (MIT). Topic: Fully
Polynomial Time Approximation Schemes for Convex and for Monotone
Stochastic Dynamic Programming. Host:
Ronitt Rubinfeld.
- November 6, 2006: Speaker: Sidharth Jaggi (MIT LIDS). Topic: Fighting
Byzantine Adversaries in Networks: Network Error-Correcting Codes.
Host: Madhu Sudan.
- November 14, 2006: Speaker: Sergey Yekhanin (MIT CSAIL). Topic: New
Locally Decodable Codes and Private Information Retrieval Schemes.
Host: Madhu Sudan.
- November 20, 2006: No Seminar due to STOC deadline.
- November 27, 2006: Speaker: Vitaly Feldman (MIT CSAIL). Topic: On
Computational Hardness of Agnostic Learning. Host: Ronitt Rubinfeld.
- December 4, 2006: Speaker: Julia Chuzhoy (IAS).
Topic: Cut Problems in Graphs: Algorithms and
Complexity. Host: Piotr Indyk.
- December 11, 2006: Speaker: Ning Xie (MIT).
Topic: Testing
k-wise and Almost k-wise Independence. Host: Madhu Sudan.
- December 18, 2006: Speaker: Evdokia Nikolova (MIT).
Topic: Stochastic Shortest Paths via Quasi-Convex
Maximization. Host: Ronitt Rubinfeld.