CSCI 338 - Algorithms, Concurrency, and the Limits of Computation                            Spring 2006

Lynn Ziegler, Instructor    Office: Science Center 215    Phone: 363-3083

Text:  Jon Kleinberg and Eva Tardos, Algorithm Design

Class Policies and ADT's

Matching Algorithm

Analysis of Algorithms

Graph Stuff

Union-Find Algorithm

More Graph Stuff: Weighted Graphs

Djikstra's Algorithm

All Pairs Shortest Path Algorithm

Proving Programs Correct

Backtracking

Boyer-Moore String Matching

Cook's Theorem

Vertex Covers, Cliques, and Independent Sets

6 basic NP-complete problems

A longer list of some NP-complete problems

Genetic Algorithms

Another HTML Validation Site