Theory Reading Group

Spring 2009 Reading Group Schedule

Date Information
Tuesday,
June 9, 2009 		Paper: Universally Utility-Maximizing privacy mechanisms by Arpita Ghosh, Tim Roughgarden, and Mukund Sundararajan
Presenter:Balu Sivan
11:00am, 3310 CS.
Tuesday,
April 28, 2009 		Paper: Testing Juntas Nearly Optimally by Eric Blais
Presenter:(Seeun) William Umboh
11:00am, 3310 CS.
Tuesday,
April 21, 2009 		Paper: Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries by Albert Atserias
Presenter:Baris Aydinlioglu
11:00am, 3310 CS.
Tuesday,
April 14, 2009 		Paper: A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem by Kamal Jain
Presenter:David Malec
11:00am, 3310 CS.
Tuesday,
March 24, 2009 		Paper: Minimum Bounded-Degree Spanning Trees by Michael Goemans
Presenter:Balu Sivan
11:00am, 3310 CS.
Tuesday,
March 10, 2009 		Paper: Poly-logarithmic independence fools AC0 circuits by Mark Braverman
Presenter:Matt Anderson
11:00am, 3310 CS.
Tuesday,
February 17, 2009 		Paper: Derandomizing Arthur-Merlin games using hitting sets by Peter Bro Miltersen and Variyam Vinodchandran
Presenter: Jeff Kinne
11:00am, 3310 CS.