Algorithms and Complexity Seminar: Spring 2009
Organizer: Aleksander Mądry (madry (at) mit.edu)
The Algorithms and Complexity seminar for Spring 2009 will
meet either Mondays, Wednesdays or Thursdays 4pm--5:15pm in
32-G575 (Theory Lab at 5th floor of Stata Center).
The style and format of these meetings are quite variable. Please feel free to
contact the host to find out more details. There is a mailing list where the announcements of upcoming talks are being sent. To subscribe to this list send an empty email to: compalgsem-subscribe **at** lists.csail.mit.edu
(Partial) Schedule:
-
Wednesday, February 11, 2009:
Speaker:
Brendan Juba
(MIT).
Topic:
A theory of goals
.
Host: Madhu Sudan
-
Wednesday, April 1, 2009:
Speaker:
Dariusz Kowalski
(University of Liverpool).
Topic:
Dynamic contention resolution on a multiple access channel
.
Host: Nancy Lynch
-
Monday, April 13, 2009:
Speaker:
Jelani Nelson
(MIT).
Topic:
Revisiting Norm Estimation in Data Streams
.
-
Monday, April 20, 2009:
Speaker:
Julia Chuzhoy
(TTI).
Topic:
Allocating Goods to Maximize Fairness
.
Host: Piotr Indyk
-
Monday, April 27, 2009:
Speaker:
Ankur Moitra
(MIT).
Topic:
On Designing Approximation Algorithms with Guarantees Independent of the
Graph Size
.
-
Monday, May 4, 2009:
No A&C seminar: Robert Schapire's Simons lecture
-
Wednesday, May 6, 2009 (the talk is at 3pm):
Speaker:
Vladimir Braverman
(UCLA).
Topic:
Measuring Independence of Datasets
.
Host: Piotr Indyk
-
Monday, May 11, 2009:
Speaker:
Arnab Bhattacharyya
(MIT).
Topic:
Lower Bounds for Testing Triangle-freeness in Boolean functions
.
-
Friday, May 15, 2009:
Speaker:
Allan Borodin
(University of Toronto).
Topic:
The Power and Limitations of Greedy Mechanism Design
for Combinatorial Auctions
.
Host: Silvio Micali
-
Monday, May 18, 2009:
Speaker:
Alexandr Andoni
(MIT).
Topic:
Approximating Edit Distance in Near-Linear Time
.
-
Monday, May 25, 2009:
No A&C seminar: Memorial Day
Archives from previous semesters:
People who attended talks like these also attended: