Theory Reading Group

Fall 2013 Reading Group Schedule

Date Information
Friday
May 3, 2013
Theory Reading
Derandomization of Auctions
Chetan Rao
1:30 pm, CS 3310
Monday
April 15, 2013
Theory Reading
Poly-logarithmic independence fools AC0 circuits
Gautam Prakriya
5 pm, CS 3310
Monday
April 8, 2013
Theory Reading
Trevisan extractor
Xi Wu
5 pm, CS 3310
Monday
April 1, 2013
Theory Reading
On Allocations that Maximize Fairness
Balu Sivan
5 pm, CS 3310
Monday
March 18, 2013
Theory Reading
Correlation Decay and Approximate Counting
Heng Guo
5 pm, CS 3310
Monday
March 11, 2013
Theory Reading
Polynomial Interpolation as a Reduction Technique for Counting Problems
Tyson Williams
5 pm, CS 3310
Friday
March 8, 2013
Theory Reading
Counting Prefect Matchings in a Planar Graph via the FKT Algorithm
Aaron Gorenstein
1:30 pm, CS 3310
Monday
March 4, 2013
Theory Reading
Fast Algorithms for Hamiltonian Cycle Problems (Part 2)
Holger Dell
5 pm, CS 3310
Monday
February 25, 2013
Theory Reading
Fast Algorithms for Hamiltonian Cycle Problems
Holger Dell
5 pm, CS 3310