Computer Science 423
Theory of Algorithms
Spring 2007
LECTURES

The schedule is tentative and may change throughout the semester

Latex template for scribing lectures can be found here.
Please send the tex and pdf files to jsyoon@cs... at the end of the day of the lecture you are scribing for.


DATE LECTURE READING
02/05/07 Binary search trees, Red-Black trees class notes
red black trees
For info on red-black trees including demos:http://en.wikipedia.org/wiki/Red_black_tree
CLRS Chapt 12, 13
02/07/07 Red-Black trees, deletion, average-case analysis of binary search trees, treaps
class notes
02/12/07 Amortized recoloring of red-black trees, splay trees
class notes
02/14/07 Amoritzed analysis of splay trees, heaps CLRS Chapt 6
MIT class notes
class notes
02/19/07 Applications of heaps, binomial heaps CLRS Chapt 19
02/21/07 (Guest Lecturer: Kevin Wayne) Fibonacci Heap lecture notes
class slides
applet
Fibonacci heaps and their uses in improved network optimization
02/26/07 Disjoint sets CLRS Chapt 21
Disjoint Set Union
02/28/07 Amortized analysis of unite-find; topics Path Compression analysis
This will conclude the first part of the course, on data structures. Next we will examine algorithms for network optimization (CLRS Chapters 23, 24, 25, and 26) and graph algorithms (CLRS Chapter 22 and notes)
03/07/07 shortest path Notes on Shortest Paths
03/12/07 shortest path, MST's Notes on Shortest Paths II
03/14/07 greedy algorithms and dynamic programming class slides
03/26/07 MST handout - MST notes
03/28/07 MST continued and Flows handout - MST notes part II
04/02/07 Max Flows .
04/04/07 Matchings Class Notes: Depth First Search
04/09/07 Graph Search Preflow Push notes
Edmonds' Incredible Shrinking Blossom Algorithm for General Matching
04/16/07 class cancelled .
04/18/07 Reductions Please see the Assignments page for information about the final project
Class Notes
04/23/07 Multiplication Class Slides
04/25/07 FFT Class Slides
05/01/07 hamilton cycle + Peculiar problems hamilton cycle
Peculiar Problems
05/03/07 Hard Problems and Special Cases Coping with NP Completeness