Textbook: Algorithm Design by Jon Kleinberg and Eva Tardos, Pearson and Addison Wesley. 2006, ISBN 0-321-29535-8.
Course Directories | Syllabus | WolframAlpha
Mailinglist (archive, sign-up, etc.)
Learning by doing You oppose claims made by others and you defend your own claims. This tests your skills in the playground. The quality of your attacks and defences determines your reputation.
The quantifier game is fun. It is hard fun. Even if you play against yourself.
Playing the quantifier game is different than getting together with other students and solving problems. You follow a structured protocol to guide your thinking in the right direction to solve the problem.
The quantifier Game in Action Recipe to teach constructive topic D: Define a playground for D and have the students play. The winning students are teachers and help the other students learn the material through skill demonstrations. The winning students demonstrate superior knowledge in domain D in the context of the given playground.
Knowledge about algorithm design turns out to be pivotal to your career as some interesting and desirable companies first screen students with algorithm questions before they advance to later stages in the interview process.
Homeworks | Lectures | Office Hours | Course Directories | Blackboard .
Computational Patterns This website makes a good attempt to capture algorithmic knowledge in the form of patterns (e.g., Dynamic Programming).
Dictionary of Algorithms and Data Structures (NIST)
Scientific Community Game (SCG) = Specker Challenge Game (SCG).
http://www.ccs.neu.edu/home/lieber/evergreen/specker/sdg-home.html http://www.ccs.neu.edu/home/lieber/evergreen/specker/new/scg.html http://www.ccs.neu.edu/home/lieber/evergreen/specker/new/SCG-kinds.html