CSE 642-01 (#49404): Seminar in Algorithms, Fall 2018

CSE 642-01 (#49404): Seminar in Algorithms, Fall 2018

Location and Hours. Wednesday 11:00 am - 12:30 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. 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.

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

Schedule.

Date	Activities	Notes / Reading Material
Fri, Aug 31	Prof. Steve Skiena poses the "MapReduce Load Balancing" problem.	-
Wed, Sep 5	We continue to work on the "MapReduce Load Balancing" problem from last week.	-
Wed, Sep 12	We continue to work on the "MapReduce Load Balancing" problem.	-
Wed, Sep 19	Prof. Rezaul Chowdhury introduces the "Apple Picking" problem.	-
Wed, Sep 26	We continue to work on the "Apple Picking" problem from last week.	-
Wed, Oct 3	Prof. Steve Skiena poses the "Point Placement Problem under Proximity Ordering."	Matthew Weston's scribe notes (distributed internally)
Wed, Oct 10	We restart working on the "Apple Picking" problem from where we left off on Sep 26.	-
Wed, Oct 17	We restart working on the "Point Placement Problem" from where we left off on Oct 3.	-
Fri, Oct 26	Informal discussion with our DLS speaker Prof. Tim Roughgarden of Stanford University.	Link to DLS Talk by Prof. Tim Roughgarden.
Wed, Oct 31	-	-
Wed, Nov 7	-	-
Wed, Nov 14	-	-
Wed, Nov 21	Thanksgiving Break	-
Wed, Nov 28	-	-
Wed, Dec 5	-	-

Past Offerings.