For example, I will post job listings, interesting problems, news of new algorithms, etc. If you try this and decide you want to stop receiving the messages, it is easy to remove yourself. First class is Thursday, January 4, 2001. Last class is Tuesday, April 17, 2001. This is a good place to meet other students and faculty in a more friendly social setting, with free food and refreshments.
Homework Assignments Get the texts , and sign up to the email group .
Read chapters 1 and 2 of the Corman, Leiserson, Rivest book. These are difficult, and rarely recieve partial credit, so attempt them only after you have solved the homework assignments. A dynamic resource location problem. The Bentley and McGeoch article Amortized Analyses of Self-Organizing Sequential Search Heuristics . Dynamic programming over trees.