Algorithms: CS 5800

This course will be taught the first time as an inverted-class-room course. The course was designed by Virgil Pavlu and you view his lectures online. The homeworks will be facilitated through Internet Study Groups. In the on campus class meetings (on Monday evenings in Hurtig Hall 130, 6-8 pm) you will learn practical skills on how to approach algorithmic problems and in the first few meetings we will practice the mechanism of Internet Study Groups.

Course Home Page NU Online | Piazza CS5800 Home Page | Internet Study Groups | Help Session Slides | Course Directories | Debates Versus Proofs

Book: Algorithms: Dasgupta, Papadimitriou, Vazirani | Virgil Pavlu's Slides | Homeworks | Socratic Method

My Background is summarized on my home page. I have done research in algorithms, a recent paper is here: 

@ARTICLE{lieber-specker:partial-2,
TITLE = "{Complexity of Partial Satisfaction II}",
AUTHOR = "Karl J. Lieberherr and Ernst Specker",
JOURNAL = "Elemente der Mathematik",
YEAR = 2012,
PAGES = "134-150",
VOLUME = 67,
NUMBER = 3,
doi = {10.4171/EM/202}
}
http://www.ccs.neu.edu/home/lieber/p-optimal/partial-sat-II/440570.pdf