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

Location and Hours. Friday 11:00 am - 12:30 pm, CS Room 2120

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:

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. Esther Arkin, Michael Bender, Jing Chen, Rezaul Chowdhury, Jie Gao, Rob Johnson, Joe Mitchell, Steve Skiena, and other algorithms faculty.


Date Activities Notes / Reading Material
Jan 31 Special Guest: Professor Muthu Muthukrishnan of Rutgers University
talks informally on interesting computer science puzzles
Feb 7 Professor Steven Skiena poses a new problem on
Measuring Memorability of Graphs
Steve's notes
Feb 14 Guest Speaker: Yael Stein of Ben Gurion University
talks about her recent results on geometric set cover and related open problems
Feb 21 Guest Speaker: Professor Miguel Mosteiro of Kean University talks on
Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions
Feb 28 Professor Joe Mitchell poses a new problem:
Tracking a Trajectory (Parade) in a Graph
Shikha's notes
Mar 7 We continue our discussion on the trajectory (Parade) tracking problem -
Mar 14 Special Guest: Zhenhua Liu of CalTech
talks informally on an open problem related to energy optimization
Mar 21 Spring Break -
Mar 28 GRC Day -
Apr 4 Special Guest: Professor Pawel Zylinski of the University of Gdansk, Poland
talks informally on open problems related to graph sweeping
Apr 11 Professor Rezaul Chowdhury poses a new problem on
Merging Bloom Filters
Apr 18 Student Presentation: Samuel McCauley on the 3SUM problem -
Apr 25 NY Area Theory Day @ Columbia University -
May 2 Guest Speaker: Professor Sandor Fekete of TU Braunschweig talks on
Cooperative Navigation for Robot Swarms
May 9 Student Presentation: Pramod Ganapthi and Samuel McCauley on their upcoming COCOON 2014 paper
titled The Range 1 Query (R1Q) Problem

Past Offerings.