Books to be put on 24-hour reserve at the EngineeringAndAppliedSciencesLibrary.
1. Course textbook
Anany Levitin, Introduction to the Design & Analysis of Algorithms, Addison-Wesley, 2003. (LevitinBook)
2. Other general algorithms textbooks
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein, Introduction to Algorithms: Second Edition, MIT Press, 2001. QA76.6 C662X 2001 (CormenEtAl)
Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest, Introduction to Algorithms, MIT Press, 1990. QA76.6 C662X 1990 (CormenEtAl)
Donald E. Knuth. The Art of Computer Programming, volumes 1-3, Addison-Wesley, 1997-1998. QA76.6 K64X 1997 (KnuthSeries)
Dexter C. Kozen. The Design and Analysis of Algorithms, Springer-Verlag, 1992. QA76.9 A43 K69X 1991 (KozenBook)
Robert Sedgewick. Algorithms in C, volumes 1-2, Addison-Wesley, 1998-2002. QA76.73 C15 S43X 1998 (SedgewickSeries)
Steven S. Skiena. Algorithm Design Manual, TELOS--the Electronic Library of Science, 1998. QA76.9 A43 S55X 1998 (SkienaBook)
3. Specialized textbooks
Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Sons, 1979. QA76.6 G35 (GareyAndJohnson)
Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics: A Foundation for Computer Science. Addison-Wesley, 1989. QA39.2 G733X 1989 (ConcreteMathematics)
Dan Gusfield. Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, 1997. QA76.9 A43 G87X 1997 (GusfieldBook)
Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, 1995. QA274 M68X 1995 (MotwaniAndRaghavan)
Christos H. Papadimitriou and Kenneth Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1982. QA402.5 P37 (PapadimitriouAndSteiglitz)
Robert E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, 1983. QA76.9 D35 T37 1983 (TarjanBook)
4. Proofs and problem-solving
George Polya. How to Solve It: A New Aspect of Mathematical Method. Princeton University Press, 1973. QA11 P65 1971 (HowToSolveIt)
Daniel Solow. How to Read and Do Proofs: An Introduction to Mathematical Thought Processes. Wiley, 2001. QA9 S577 2001 (SolowBook)