Instructor: Lenore Cowen
Halligan 107A; 627-5134; cowen AT cs.tufts.edu ;
Office Hours: TBA
Lectures: Tuesdays, 6:30pm in Halligan 111B
Note: No Tuesday, March 21 (Tufts Spring Break) or Tuesday, April 17 (Prof. Cowen out of town). Because of the Tuesday, April 17 holiday, we WILL Hold a makeup class on Tuesday, May 1.
Description: If you loved your algorithms class and can't wait for more, this is the class for you. In this pleasant and fun class, we will look at some more modern algorithms, some beautiful algorithms gems, and some areas of current research in algorithms. Topics will include using randomness in the design and analysis of algorithms, approximation algorithms, and online algorithms.
The website for this class is at http://www.cs.tufts.edu/comp/260
Prerequisites: Comp 160 or permission of the instructor.
There is no text for this course.
The course was last taught in 2016. with lecture notes here
Here is a Template for scribe notes with instructions for first-time Latex users
Please note that many of the scribe notes below were based also on scribe notes from previous year lectures.
HW1 (due Tuesday, February 6 in class)
HW2 (due Tuesday, February 20 in class)
HW3 (due Tuesday, March 13 in class)
HW4 (due Tuesday, April 24 in class)
In this section we link to current research papers that are related to the topics of the lectures of this course.