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

- Monday, October 11, 2010: No A&C seminar: Columbus Day
- Monday, October 25, 2010: No A&C seminar: FOCS
- Thursday, October 28, 2010: Speaker: Gilad Tsur (Tel-Aviv University). Topic: Testing Properties of Sparse Images .
- Thursday, November 11, 2010: No A&C seminar: Veteran's Day
- Thursday, November 18, 2010 (UNUSUAL ROOM: G449): Speaker: Shaddin Dughmi (Stanford University). Topic: How to Compute in a Selfish Society: Randomness May be the Key .
- Thursday, November 25, 2010: No A&C seminar: Thanksgiving
- Monday, January 17, 2011: No A&C seminar: Martin Luther King, Jr. Day
- Wednesday, December 1, 2010: Speaker: Virginia Vassilevska Williams (UC Berkeley). Topic: Faster replacement paths .
- Monday, December 13, 2010: Speaker: Ofer Neiman (Princeton University). Topic: Near Linear Lower Bound for Dimension Reduction in L_1 .

- 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)