Location and Hours. Friday 11:00 am - 12:30 pm, Computer Science Lounge (CS Building 2129)

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.
• Open Problem Bull Sessions -- We pose and attack accessible research problems.
• Road Trips -- We take road trips to the special computational geometry or theory days at NYU, Columbia, and the like.

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

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

Instructors (alphabetically). Esther Arkin, Michael Bender, Jing Chen, Rezaul Chowdhury, Jie Gao, Rob Johnson, Joe Mitchell, Steve Skiena, and other algorithms faculty.

Schedule.

Past Offerings.

• Fall 2012
• Fall 2011
• Spring 2011
• Spring 2010
• Fall 2008
• Spring 2008
• Fall 2007
• Spring 2007
• Fall 2006
• Spring 2006