Chapter Notes

A classic reference for the material presented in this chapter is Fundamental Algorithms, volume 1 of The Art of Computer Programming, by Donald Knuth. The book, published by Addison-Wesley, originally appeared in 1968 and, along with the companion volumes, is a classic that should be on every computer scientist's desk. An excellent book on discrete mathematics is the book Discrete Algorithmic Mathematics by S.B. Maurer and A. Ralston (Addison-Wesley Publishing Company, Reading, MA, 1991). An interesting book, combining discrete and continuous mathematics, is Concrete Mathematics by R.L. Graham, D.E. Knuth, and O. Patashnik (Addison-Wesley Publishing Company, Reading, MA, 1989). Finally, we should mention an excellent book, Introduction to Algorithms, by T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein (2nd ed.: MIT Press, Cambridge, MA, 2001). This book covers fundamental mathematics for algorithmic analysis in a thorough fashion.