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

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

Location and Hours. Friday 11:00 am - 12:30 pm, Room 220 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.
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, Rob Johnson, Joe Mitchell, Rob Patro, Steve Skiena, and other algorithms faculty.

Schedule.

Date	Activities	Notes / Reading Material
Fri, Jan 26	We have an informal discussion with Prof. Suresh Venkatasubramanian. Prof. Venkatasubramanian's formal talk on Algorithmic Fairness is on Thursday (Jan 25) at 2:30pm in NCS 120. Click here for the talk announcement.	-
Fri, Feb 2	We continue our discussion on the problem Prof. Suresh Venkatasubramanian proposed last week.	-
Fri, Feb 9	Prof. Joe Mitchell proposes problems on moving a swarm of robots through a graph/network.	-
Fri, Feb 16	We continue our discussion on the robot swarms problems.	-
Fri, Feb 23	We continue our discussion on the robot swarms problems.	-
Fri, Mar 2	We have an informal discussion with our special guest Prof. Lydia Kavraki of Rice University (our DLS speaker).	Link to DLS Talk by Prof. Lydia Kavraki.
Fri, Mar 9	Our special guest Prof. Matya Katz of Ben-Gurion University proposes an open problem.	-
Fri, Mar 16	Spring Break	-
Fri, Mar 23	Our special guest Prof. Jeffrey Heinz of the Department of Linguistics and the Institute for Advanced Computational Science (IACS) poses several algorithmic problems in linguistics.	-
Fri, Mar 30	Prof. Joe Mitchell starts discussion on "Finding October."	-
Fri, Apr 6	We continue our discussion on "Finding October."	-
Fri, Apr 13	Graduate students Rathish Das, Shih-yu Tsai, and Sharmila Venkata Sathya Duppala introduce several new problems they are currently working on related to space-time tradeoffs in parallel computing.	-
Fri, Apr 20	We continue our discussion on the space-time tradeoff problems from last week.	-
Fri, Apr 27	Lucas Farach-Colton talks about his graph-theoretic result on the spam resistance of page rank. Dr. James Zuber introduces a 2D non-sorted ordering problem related to optimizing warehouse-product placement.	-
Fri, May 4	We continue our discussion on the space-parallelism tradeoff problems introduced by graduate students Rathish Das, Shih-yu Tsai, and Sharmila Venkata Sathya Duppala on April 23	-

Past Offerings.