Advanced Algorithms

COT5405 Fall 2007

Course Information Handout: [pdf]

Instructor

Piyush Kumar

Lecture Time and Place

Tuesday , Thursday. 3:35 - 4:50pm. Love 0103.
Instructor Office Hours: Tuesday, After Class.
TA: Samidh Chatterjee
TA Office Hours: TBA.

Lecture Notes/Slides

You will be able to find the lecture notes/slides here. Class readings/homework assignments can be found here.

Course Description

This is a graduate level course in algorithms. You will be expected to know the material taught in 4531 well. You can find more about the course in the Course Information Handout.

Learning Objectives

The objective of this course is to encourage you to learn how to :

Textbooks

I will assume that each of you own a copy of Algorithm Design (Hardcover) by Jon Kleinberg, Éva Tardos ISBN: 0321295358. You should also have access to [CLRS] book that I use in 4531. Most of the material in the course will be from the following books.

[CLRS]
 T. Cormen, C. Leiserson, R. Rivest, and C. Stein.
Introduction to Algorithms (2nd edition). MIT Press / McGraw-Hill, 2001.
[MR] R. Motwani and P. Raghavan.
Randomized Algorithms. Cambridge University Press, 1995.
[V] V. V. Vazirani.
Approximation Algorithms.
[AMO] . Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin.
Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.

Useful Links

  • Succeeding in Algorithms Class
  • Interesting Algorithms Classes [1] [2] [3] [4]
  • Cheat Sheet
  • Advanced Computational Geometry
  • Some more material
  • The LEDA Book
  • How to Present a Paper in Theoretical Computer Science, by Ian Parberry.
    • Remember, choosing when to take Algos based on the professor teaching it is like trying to choose which barrel of boiling oil to swim in based on the color of the barrel. Besides, you'll probably have to take it more than once anyway. --Anonymous