CS860 (Spring 2007) - Adaptive, Output Sensitive, Online and Parameterized Algorithms

Schedule

There are 12 lectures, one per week. Student sessions correspond to the presentation of a paper chosen from the list and validated by an instructor.
Session Date Topic Presenter Slides
1 May 1st Administrative Meeting Jeremy Barbay - Alex Lopez-Ortiz
2 May 8th Introduction: A bridge between theory and practice (1/2 session) Alex Lopez-Ortiz
3 May 8th Comp. Geometry: Convex Hull and other problems (1/2 session) Timothy Chan
4 May 15th Adaptive Sorting (1 session) Alex Lopez-Ortiz
5 May 22nd Adaptive Union and Intersection (1/2 session) Alex Lopez-Ortiz ppt
6 May 22nd Adaptive Intersection ++ (1/2 session) Jeremy Barbay pdf
7 May 29th Adaptive Pattern Matching (1/2 session) Jeremy Barbay pdf
8 May 29th Online Algorithms (1/2 session) Alex Lopez-Ortiz ppt
9 June 5th Parameterized Complexity Jonathan Buss
Student Presentation June 12th "A framework for adaptive sorting" by Petersson and Moffat Daniel Roche
Student Presentation June 12th "output-sensitive construction of four-dimensional polytopes and three-dimensional Voronoi diagrams" by Timothy Chan Bob Fraser
Student Presentation June 19th "Fast Sorting and Pattern-avoiding Permutations" by David Arthur [ANALCO07] Alejandro Salinger
Student Presentation June 26th Canonical Triangulation of a Graph, with a Coding Application, from Luca Castelli Aleardi and Olivier Devillers. Krishnam Raju Jampani
Student Presentation June 26th "Sorting Presorted Files" by Kurt Mehlhorn Mosharaf K Chowdhury
10 July 3rd Instance Optimality Ihab Ilias
Student Presentation July 10th "Best sorting algorithm for nearly sorted lists", by Curtis R. Cook and Do Jin Kim Iman
Student Presentation July 10th "A New Approach on Solving 3-Satisfiability", by Rodosek Farheen Omar
Bibliography Reviews July 17th Daniel Roche, Bob Fraser, Alejandro Salinger, Krishnam Raju Jampani
Bibliography Reviews July 24th Mosharaf K Chowdhury, Iman, Farheen Omar