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:
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 |
Fri, Aug 28 | Professor Joe Mitchell introduces a brand new problem: "well-separated nodes in graphs/networks" |
Caleb Andrade & Hirak Sarkar's notes (distributed internally) |
Fri, Sep 4 | We continue our discussion on the problem Prof. Joe Mitchell introduced last week | Caleb Andrade & Hirak Sarkar's notes (distributed internally) |
Fri, Sep 11 | We continue our discussion on the problem from last week | Yinkai Li's notes (distributed internally) |
Fri, Sep 18 | CS Tech Day (no meeting) |
- |
Fri, Sep 25 | Continued our discussion on the problem from Sep 11 | - |
Fri, Oct 2 | Continued and concluded our discussion on the problem from last week, and had a brief discussion on potential algorithmic problems related to countercurrent heat exchange (as proposed by Prof. Michael Bender) | - |
Fri, Oct 9 | Professor Jie Gao introduces a brand new problem: "placing antennas in the visibility graph of a polygon" |
Scribe notes by Ratish Das (distributed internally) |
Fri, Oct 16 | Prof. Andrew Mullhaupt discusses algorithmic problems in Quantitative Finance | Preview and Bio |
Fri, Oct 23 | FWCG (no meeting) |
- |
Fri, Oct 30 | Prof. Andrew Mullhaupt continues his discussion on algorithmic problems in Quantitative Finance | - |
Fri, Nov 6 | Open Problems Session (with Dongdong Ge and Mayank Goswami) | - |
Fri, Nov 13 | Mayank Goswami talks "On Clairvoyance in Binary Search Trees: Recent Progress on the Dynamic Optimality Conjecture" Also Today: New York Area Theory Day |
Abstract and Bio |
Fri, Nov 20 | No meeting | - |
Fri, Nov 27 | Thanksgiving Break | - |
Fri, Dec 4 | - | - |
Past Offerings.