• Title Concrete Mathematics: A Foundation for Computer Science (2nd Edition)
• Author(s) Ronald L. Graham, Donald Ervin Knuth, Oren Patashnik
• Publisher: Addison-Wesley Professional; 2 edition (March 10, 1994)
• Hardcover 672 pages
• eBook PDF (670 pages, 2.8 MB)
• Language: English
• ISBN-10/ASIN: 0201558025
• ISBN-13: 978-0201558029
• Share This:  

Book Description

This book introduces the mathematics that supports advanced computer programming and the analysis of algorithms. The primary aim of its well-known authors is to provide a solid and relevant base of mathematical skills - the skills needed to solve complex problems, to evaluate horrendous sums, and to discover subtle patterns in data.

It is an indispensable text and reference not only for computer scientists - the authors themselves rely heavily on it! - but for serious users of mathematics in virtually every discipline.

This second edition includes important new material about mechanical summation.

• Ronald L. Graham was an American mathematician credited by the American Mathematical Society as "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years".
• Donald Ervin Knuth is an American computer scientist, mathematician, and professor emeritus at Stanford University. He is the 1974 recipient of the ACM Turing Award, informally considered the Nobel Prize of computer science.[4] Knuth has been called the "father of the analysis of algorithms".

• Amazon

• Discrete and Finite Mathematics
• Introduction to Computer Science
• Graph Theory
• Algebra, Abstract Algebra, and Linear Algebra
• Mathematical Logic (Set Theory, etc.)
• Probability and Stochastic Processes

• Concrete Mathematics: A Foundation for Computer Science, 2nd Edition (Donald E. Knuth, et al)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - First Edition - PDF
• The Mirror Site (3) - First Edition - PDF

• Discrete Mathematics for Computer Science (Jean Gallier)
• Building Blocks for Theoretical Computer Science (Margaret Fleck)
• Discrete Mathematics with Algorithms (M. O. Albertson, et al)