14s: participating seminar in theoretical computer scienceThe course announcement is here. We meet on Wednesdays, 4–6, in MS 3915D.
The papers we're reading are collected here. (See also the link to Will's notes below.)
Pietro, Sam, and Anand have a nice proof of the hardness of random functions. It's here.
The current list (numbered by week) of speakers is below. Email Siddharth, Will, or me if you think this should be revised.