The Algorithms and Complexity seminar for Spring 2010 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

- Thursday, March 18, 2010: Speaker: Yashodhan Kanoria (Stanford University). Topic: A Natural Dynamics for Bargaining on Exchange Networks .
- Thursday, April 15, 2010: Speaker: Mohammad Hossein Bateni (Princeton University). Topic: PTAS for planar Steiner forest .
- Monday, April 19, 2010: No A&C seminar: Patriots Day
- Wednesday, April 21, 2010: Speaker: Aleksander Mądry (MIT). Topic: Fast Approximation of Multicommodity Flow Problems via Dynamic Graph Algorithm .
- Thursday, April 22, 2010: Speaker: Guy Rothblum (Princeton University). Topic: Pan-Private Streaming Algorithms and Continual Observation .
- Wednesday, May 5, 2010: Speaker: Rotem Oshman (MIT). Topic: Distributed Computation in Dynamic Networks.
- Thursday, May 13, 2010: Speaker: Ping Li (Cornell). Topic: Compressed Counting for Estimating Frequency Moments and Entropy of Data Streams .
- Wednesday, July 21, 2010: Speaker: Yoram Bachrach (Microsoft Research). Topic: Fast Pseudo-Random Fingerprints.

- MIT Applied Math Colloquium (Mondays)
- MIT Theory of Computation Colloquium (Tuesdays)
- MIT SSG (Stochastic Systems Group) Seminar (Wednesdays)
- MIT LIDS Seminar (Tuesdays)
- MIT Combinatorics Seminar (Wednesdays & Fridays)
- MIT Operations Research Center Seminars (Thursdays)
- MIT Algorithms Reading Group (Fridays)
- MIT Crypto-Complexity Reading Group (Mondays)
- Harvard Theory of Computation Seminar (Mondays)