Location and Hours. Friday 11:00 am - 12:15 pm, Room 120 of New CS Building

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:

• Open Problems Sessions -- We pose and attempt to solve brand new research problems.
• Guest Speakers -- Sometimes we invite researchers from other departments or institutions to pose fun problems.
• Paper Presentations -- This is fairly informal, with one person (often a 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.
• Road Trips -- We make 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, attending 80% of the meetings, and scribing one lecture. You are also welcome to come without registering.

Mailing List. We have a Google group. Future announcements will be distributed through the group forum and email. Please apply here to join the group.

Scribe Notes. Scribe notes will be available on Blackboard and can also be accessed through the Google drive link shared with our Google group members.

Instructors. Esther Arkin, Michael Bender, Rezaul Chowdhury, Joe Mitchell, Steve Skiena, and other algorithms faculty.

Schedule.

Past Offerings.

• Fall 2019
• Spring 2019
• Fall 2018
• Spring 2018
• Fall 2017
• Spring 2017
• Fall 2016
• Spring 2016
• Fall 2015
• Spring 2015
• Fall 2014
• Spring 2014
• Fall 2012
• Fall 2011
• Spring 2011
• Spring 2010
• Fall 2008
• Spring 2008
• Fall 2007
• Spring 2007
• Fall 2006
• Spring 2006