- Textbook:
Graham, Knuth, and Patashnik: Concrete Mathematics: A Foundation for Computer Science, 2nd Ed., Addison-Wesley, 1994

- References:
- D.E. Knuth: The Art of Computer Programming, 1: Fundamental Algorithms, 3rd Ed., Addison-Wesley, 1997
- D.E. Knuth: The Art of Computer Programming, 2: Seminumerical Algorithms, 3rd Ed., Addison-Wesley, 1997
- D.E. Knuth: The Art of Computer Programming, 3: Sorting and Searching, 2nd Ed., Addison-Wesley, 1998
- D. Green and D.E. Knuth: Mathematics for the Analysis of Algorithms, 3rd Ed., Birkhauser, 1990
- R. Sedgewick and P. Flajolet: An Introduction to the Analysis of Algorithms, 2nd Ed., Addison-Wesley, 2013
- P. Flajolet and R. Sedgewick: Analytic Combinatorics, Cambridge University Press, 2009
- Syllabus:
- Recurrences
- Sums
- Integer Functions
- Elementary Number Theory
- Binomial Coefficients, Hypergeometric Functions
- Special Numbers
- Generating Functions
- Discrete Probability
- Asmptotics
- Mathematical Analysis of Fundamental Algorithms
- Handouts:
- Binary Search Trees: bst.pdf
- Guessing method: guess.pdf
- Homeworks:
- Homework 1: Hw1.pdf, (due day: 3/5)