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, Rob Patro, Steve Skiena, and other algorithms faculty.
Schedule.
Date | Activities | Notes / Reading Material |
Aug 29 | Professors Steven Skiena and Rob Patro pose the Prefix Matching Problem |
Sichen Zhong's notes |
Sep 5 | We continue our discussion on the Prefix Matching Problem |
Sichen Zhong's notes |
Sep 12 | CS Technology Day ( no reading group meeting ) |
- |
Sep 19 | We continue our discussion on the Prefix Matching Problem |
Sichen Zhong's notes |
Sep 26 | Guest Speaker: Professor Igor Pak of UCLA talks on How to prove Steinitz's theorem |
abstract |
Oct 3 | We continue our discussion on the Prefix Matching Problem |
Sichen Zhong's notes |
Oct 10 | We continue our discussion on the Prefix Matching Problem |
- |
Oct 17 | Professor Adam Siepel of CSHL discusses some interesting problems in Genomics |
- |
Oct 24 | CS PhD student Hirak Sarkar poses an open problem in digital tomography |
- |
Oct 31 | FWCG 2014 ( no reading group meeting ) |
- |
Nov 7 | Professor Joe Mitchell discusses variants of the Freeze Tag Problem |
- |
Nov 14 | We continue our discussion on the Freeze Tag Problem |
- |
Nov 21 | We continue our discussion on the Freeze Tag Problem |
- |
Nov 28 | Thanksgiving Break | - |
Dec 5 | We continue our discussion on the Freeze Tag Problem |
- |
Past Offerings.