Algorithms Seminar (CSE642)
Fall 2012

Locations and Hours:

Friday 11:00 -12:30 @ Computer Science Lounge (CS Building 1211).

Course Description:

This reading group provides a meeting place for Stony Brook faculty, postdocs, and students interested in the analysis of algorithms. We meet once a week, with one of three different missions:

• Paper Presentations -- This is fairly informal, with one person (i.e. student) responsible each time for leading the discussions. Nobody will have to lead for more than one paper per semester. We highly encourage students to volunteer for paper presentations, as it is a good opportunity to learn how to give a technical presentation and our reading group is a friendly group of audience to start with. The list of papers you can choose to present, if you do not have a paper already, can be found below.
• Open Problem Bull Sessions -- where we pose and attack accessible research problems. A good time is had by all.
• Road Trips -- to the special computational geometry or theory days at NYU, Columbia, and the like.

You can get one credit for participating by simply registering for CSE 642. You are also welcome to come without registering. 

We have a mailing list. Further announcement will be distributed through the list. Please subscribe here.  

Schedule:

• Aug 31: Professor Michael Bender indtroduced a new problem. Sean Munson took notes.