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:
Course Credit. You can get one credit for participating by simply registering for CSE 642, attending 80% of the meetings, and scribing one lecture. 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.
Scribe Notes. Scribe notes will be available on Blackboard and can also be accessed through the Google drive link shared with our Google group members.
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 |
| Wed, Jan 30 | Prof. Steve Skiena poses a brand new problem on MapReduce | Scribe: Rory Bennett |
| Wed, Feb 6 | CS Graduate Research Day (no reading group meeting) |
- |
| Wed, Feb 13 | We continue our discussions on the MapReduce problem from week 1 | Scribes: Milto Ndrenika, Pratik Pantode, and Rahul Lachhani |
| Wed, Feb 20 | Prof. Michael Bender reintroduces the "Reviewer's Dilemma" problem from Fall 2018 | Scribes: Aravind Reddy Ravula, Mohit Choudhary, Samanvitha Reddy Panyam, and Shireen Nagdive |
| Wed, Feb 27 | We continue our discussion on the "Reviewer's Dilemma" problem | Scribes: Neal Beeken, Nitin Kumar Mangalam, Sagar Gurtu, and Vishnu Dutt Paladugu |
| Wed, Mar 6 | We continue our discussion on the "Reviewer's Dilemma" problem | Scribes: Hirak Sarkar, Krapi Ravindra Shah, Mina Abbasi Dinani, Vivek Bansal, and Sampath Kumar Kilaparthi |
| Wed, Mar 13 | Prof. Joe Mitchell poses a set of problems on multiple vehicle co-ordination | Scribes: Mohaddeseh Bastan, Shoaib Sheriff, and Tianchi Mo |
| Fri, Mar 15 | Talk by Dr. Jon Lenchner of IBM Research Yorktown Heights on "From Hall's Marriage Theorem to Boolean Satisfiability and Back" | Talk Abstract and Speaker Bio |
| Wed, Mar 20 | Spring Break | - |
| Wed, Mar 27 | We continue of discussion on the problems Prof. Joe Mitchell introduced before Spring Break | Scribes: Ishan Sohony, Sachin Hulyalkar, and Chandrika Kapre |
| Wed, Apr 3 | Talk by Prof. Paz Carmi of Ben-Gurion University on "Stabbing Pairwise Intersecting Disks by Four Points" | Talk Abstract Scribes: Diksha Saini, Huan Nguyen, and Rucha Abhyankar |
| Wed, Apr 10 | Talk by Dr. Alan Kuhnle of the University of Florida on "Efficient Methods for Large-Scale Data Analysis" | Talk Abstract and Speaker Bio Scribes: Akshay Mallipeddi, Anirudh Kulkarni, Sagar Sahai, and Laraib Malik |
| Wed, Apr 17 | We discuss a couple of new problems proposed by Prof. Joe Mitchell on inclusion of nearest neighbor edges in TSP | Scribes: Jarin Firose Moon, Ibrahim Umit Akgun, and Utku Uckun |
| Wed, Apr 24 | We discuss several special cases of the "School Bus Problem" posed by Prof. Joe Mitchell earlier in the semester | Scribes: Divyam Jaiswal, Seyedhamed Ghavamnia, Venkata Divya Kootagaram, Wangshu Luo, and Adarsh Alangar |
| Wed, May 1 | Talk by Prof. Sándor P. Fekete of the Department of Computer Science, TU Braunschweig, Germany, on "The Critical Packing Density of Circles" | Talk Abstract Scribes: Emil Joswin, Harpreet Singh Chawla, Shobhit Khandelwal, Varun Goel, and Rahul Madiwale |
| Mon, May 20 | Talk by Arnold Filtser of Ben-Gurion University on "Steiner Point Removal with distortion O( log k ), using the Relaxed Voronoi algorithm" | Talk Abstract and Speaker Bio |
Past Offerings.