UW-Madison
Computer Sciences Dept.

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 Fall 2009 is Thursday at 12:30pm. We meet at that time in the lobby by the elevators and go from there (while they are still there, we usually go to the carts on the State St. mall and eat at Memorial union by the lake). New graduate students are encouraged to attend.

Reading Group

Also each week, but separately from the lunch group (i.e. different time and day) 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 (with the approval of those present the previous week) a paper/topic to present. Information about upcoming meetings will be posted to this web-page 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 and comments should be directed to "seeun" at the cs.wisc.edu server.

The meetings typically last 60-90 minutes.

Fall 2009 Reading Group Schedule

Upcoming Topic / Paper / Presenter
Monday
November 23, 2009
Asymmetric Traveling Salesman Problem
Paper:
M. Charikar, M. Goemans, and H. Karloff.
On the integrality ratio for the asymmetric traveling salesman problem.
Mathematics of Operations Research, 31:245-252, 2006.
Presenter: David Malec
3pm, 4310 CS
Tuesday
November 24, 2009
Applications of AP3-Free Sets
Paper:
Ashok Chandra, Merrick Furst, and Richard Lipton.
Multi-party protocols.
STOC'83, pages 94-99.
Presenter: Balu Sivan
5pm, 3310 CS
Monday
November 30, 2009
Asymmetric Traveling Salesman Problem
Paper:
M. Blaser.
A new approximation algorithm for the asymmetric TSP with triangle inequality.
In ACM-SIAM Symposium on Discrete Algorithms, pages 638-645, 2002.
Presenter: Balu Sivan
3pm, 4310 CS
Rescheduled(TBA) Applications of AP3-Free Sets
Paper:
Johan Hastad and Avi Wigderson.
Simple analysis of graph tests for linearity and PCP.
Random Structures and Algorithms, 22(2): 139-160, 2003.
Presenter: Baris Aydinlioglu
5pm, 3310 CS
Recent Topic / Paper / Presenter
Monday
November 16, 2009
Asymmetric Traveling Salesman Problem
Paper:
A. M. Frieze, G. Galbiati, and F. Maffioli.
On the worst-case performance of some algorithms for the asymmetric traveling salesman problem.
Networks, 12:23-39, 1982.
Presenter: Shuchi Chawla
3pm, 4310 CS
 

Previous years' Schedules:

Spring 2005
Summer 2005
Fall 2005
Spring 2006
Summer 2006 - no meetings
Fall 2006
Spring 2007 - no meetings
Fall 2007
Spring 2008
Summer 2008
Fall 2008
Spring 2009

 
Computer Sciences | UW Home