The Algorithms and Complexity seminar for Spring 2011 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, February 21, 2011: No A&C seminar: Presidents Day
- Monday, February 28, 2011: Speaker: Seth Pettie (University of Michigan). Topic: Approximate Weighted Matching in Linear Time .
- Monday-Friday, March 21-25, 2011: No A&C seminar: Spring Break
- Monday, April 18, 2011: No A&C seminar: Patriots Day
- Monday, April 25, 2011: Speaker: Elena Grigorescu (Georgia Tech). Topic: Testing Odd-Cycle Freeness of Boolean Functions .

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