Algorithms and Complexity Seminar: Fall 2009
The Algorithms and Complexity seminar for Fall 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:
-
Monday, October 12, 2009:
No A&C seminar: Columbus Day
-
Monday, October 19, 2009 UNUSUAL TIME: 3pm:
Speaker:
Nikhil Srivastava
(Yale University).
Topic:
Twice-Ramanujan Sparsifiers
.
-
Wednesday, October 21, 2009:
Speaker:
Christian Sommer
(University of Tokyo).
Topic:
Distance Oracles for Sparse Graphs
.
-
Monday, October 26, 2009:
No A&C seminar: FOCS
-
Wednesday, November 11, 2009:
No A&C seminar: Veteran's Day
-
Thursday, November 12, 2009:
Speaker:
Volkan Cevher
(Rice University).
Topic:
Compressible priors and structured sparsity models
.
-
UNUSUAL DAY: Friday, 4pm, November 13, 2009 :
Speaker:
Elad Verbin
(Tsinghua University).
Topic:
Data Structure Lower Bounds using Statistical Reasoning
.
-
Wednesday, November 18, 2009:
Speaker:
Avinatan Hassidim
(MIT).
Topic:
Phylogenetic Tree Reconstructions With Insertions and Deletions
.
-
Thursday, November 26, 2009:
No A&C seminar: Thanksgiving
Archives from previous semesters:
People who attended talks like these also attended: