Books
The lectures will come from a variety of sources but one book that will be used more than others will be:
| Introduction to Algorithms |
| T. Cormen, C. Leiserson, R. Rivest, C. Stein |
| McGraw Hill, 2001 |
Another very popular text is Kleinberg and Tardos:
| Algorithm Design |
| Kleinberg and Tardos |
| Addison-Wesley, 2005 |
Here is a list of some of the more popular texts that you might find helpful. The web is also an excellent source of information. Note, though, that not all sources on the web are completely reliable.
| The Design and Analysis Algorithms |
| Dexter C. Kozen |
| Springer-Verlag, 1992 |
| Randomized Algorithms |
| Motwani and Raghavan |
| Cambridge University Press, 1995 |
| Computer Algorithms, Introduction to Design and Analysis |
| Sarah Baase, Allen van Gelder |
| Addison-Wesley, 2000 |
| Introduction to Algorithms: A Creative Approach |
| U. Manber |
| Addison-Wesley, 1990 |
| The Design and Analysis of Computer Algorithms |
| A. Aho, J. Hopcroft, J. Ullman |
| Addison-Wesley, 1974 |
| Algorithmics: Theory and Practice |
| G. Brassard, P. Bratley |
| Prentice Hall, 1996 |
On the webComputational Geometry Algorithms and Applications By M. de Berg, M. van Kreveld, M. Overmars, and O. Cheong