Meeting Time: Monday and Wednesday 3:00 - 4:20 (T hour)
Catalogue Description:
In this course, we study a selection of advanced algorithms and data structures that are provably correct and fast. Our goal is to present a broad range of algorithmic ideas and techniques, especially those that have had significant impact on the field and/or have had or might have practical impact. Prerequisite: CSCI 1570 or the equivalent.
To be eligible to take Advanced Algorithms, you must have taken an algorithms course aimed at graduate students or upper-division undergraduates. At Brown University, CSCI 1570 is such a course. If you have taken such a course elsewhere, contact me to request an override through the Course Announcement Bulletin. If possible, please provide a link to information on the course you took.
The course will require you to work on problem sets (often in collaboration with other students) and occasionally work on problems during class (again, often in collaboration with other students).
My goal is that you become familiar with some advanced algorithmic and data-structure techniques, both because they are beautiful and because they are potentially useful.
I will present some topics that illustrate some important and impactful algorithmic and data-structure ideas, especially in the area of discrete optimization, broadly construed.
The course calendar gives my best guess as to the topic to be discussed in each lecture.
Below are topics I am planning to discuss.