You have reached the homepage for the Northeastern University, College of Computer and Information Science, Fall 2006 session of Advanced Algorithms, also known as "CSG713 06F." CSG713 is an graduate course on the design and analysis of algorithms. Topics covered will include various paradigms for algorithm design (e.g., divide-and-conquer, greedy, dynamic programing, graph theoretic, network flow, linear programming, and approximation algorithms, etc.) as well as various analysis techniques (recurrence relations, amortized analysis, and expected/randomized analysis, etc.).
This document, and all documents on this website, may be modified from time to time; be sure to reload documents on occasion and check the "last modified" date against any printed version you may have.