Great Theoretical Ideas in Computer Science
BH 136A (the Adamson wing), TR 3:00-4:20P

Related Texts

As mentioned in the course syllabus, there is no textbook for this course. If you must have a book, buy Applied Combinatorics, by Alan Tucker (available at Amazon.com) and/or Discrete Mathematics And Its Applications, by Kenneth H. Rosen.

If you want to look at other books which contain part of the course material, we recommend the following:

  • Discrete Mathematics: Elementary and Beyond, by L. Lovasz, J. Pelikan, and K. Vesztergombi, published by Springer Verlag.
  • Applied Combinatorics, by A. Tucker, published by Wiley & Sons.
  • Concrete Mathematics: A Foundation for Computer Science, by R. Graham, D. Knuth, and O. Patashnik, published by Addison-Wesley.
  • Introduction to Algorithms, by T. Cormen, C. Leiserson, R. Rivest, and C. Stein, published by MIT Press.
  • Discrete Mathematics and its Applications, by K. H. Rosen, published by McGraw-Hill.
  • How To Solve It: A New Aspect of Mathematical Method, by G. Polya, published by Princeton University Press.
  • Programming Pearls and More Programming Pearls, by J. Bentley, published by Addison-Wesley.
  • Conceptual Blockbusting: A Guide to Better Ideas, by J. L. Adams, published by W. W. Norton & Company.
  • The Heritage Of Thales, by W.S. Anglin and J. Lambek, published by Springer-Verlag.
  • Proofs Without Words I and II (exercises in visual thinking), by Roger B. Nelson, published by The Mathematical Association Of America.
  • The Book Of Numbers, by John H. Conway and Richard K. Guy, published by Springer-Verlag.
  • Aha! Gotcha (Paradoxes to puzzle and delight.), by Martin Gardner, published by Freeman Publishers.
  • Proofs From The Book, by Martin Aigner and Gunter Ziegler, published by Springer-Verlag.

© 2006 Carnegie Mellon University, all rights reserved.