CS 5114: Algorithms

The following books are on reserve in Newman Library. You may check them out from the reserve desk for a maximum of 2 hours. There is only one copy of each book on reserve. Remember that your classmates may wish to use these books also; please be considerate of their needs. If you need to use these books before a deadline, please try to do so well before the deadline.

Algorithmic Number Theory by Eric Bach and Jeffrey Shallit. QA241 B1085 1996
The LaTeX Companion by Goosens, Mittleback, and Samarin. Z253.4 L38 G66
Learning LaTeX by Griffiths and Higham. Z253.4 L38 G75
LaTeX: A Document Preparation System by Lamport. Z253.4 L38 L35
The Design and Analysis of Computer Algorithms by Aho, Hopcroft, and Ullman. QA76.6 A36
Probability, Statistics, and Queueing Theory by Allen. QA273 A46 1990
Introduction to Algorithms by Cormen, Lieserson, and Rivest. QA76.6 C662 1990
Computers and Intractability: A Guide to the Theory of NP-completeness by Garey and Johnson. QA76.6 G35
Introduction to Algorithms: A Creative Approach by Manber. QA76.9 D35 M36 1989
Applied Combinatorics by Roberts. QA164 R6 1984
Approximation Algorithms for NP-hard Problems by Hochbaum. T57.7 A68 1997

CS 5114: Algorithms - Fall 2000