|
Theory Students' Lunch and Reading Group
Student Lunch
Each week many of the theory students meet to have lunch together. The event is mostly a social event so that the students can stay in touch with each other - sharing gossip, advice, news, etc. about theory, graduate school, and life. All are welcome to attend. News and planning of the weekly lunch is communicated via the theory students email list. For more information, please contact Seeun (William) Umboh, "seeun" at the cs.wisc.edu server.
The lunch day and time for Spring 2013 is Wednesday at 12:30. We meet at that time in the lobby by the elevators and decide where to go from there. When the weather is good, we usually go to the carts on the State St. mall and eat at the Memorial union, either inside or by the lake. Otherwise, we go to a nearby restaurant. New graduate students are encouraged to attend.
Reading Group
Each week, but separately from the lunch group (i.e. different time and day), the theory students meet to discuss a paper or topic of interest to the group. Topics range from fundamental theorems and tools to current research. Each week a different person chooses a paper/topic to present. Information about upcoming meetings will be posted to this webpage in addition to being mailed to the theory-reading mailing list. To join the list, go to theory-reading list and follow the instructions. Any questions or comments should be directed to "seeun" at the cs.wisc.edu server.
Fall 2011 Reading Group Schedule
|
Recent
|
Topic / Paper / Presenter
|
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
|
Previous years' Schedules
|
