Concrete mathematics - a foundation for computer science

  title={Concrete mathematics - a foundation for computer science},
  author={Ronald L. Graham and Donald Ervin Knuth and Oren Patashnik},
From the Publisher: 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… 
Algorithms in Symbolic Computation
This chapter presents more detailed descriptions of hot research topics currently pursued at RISC, and describes the development of Nonlinear Resonance Analysis, a new branch of mathematical physics.
Programming with Mathematica: An Introduction
This book will appeal to students, researchers and programmers wishing to further their understanding of Mathematica language, and assumes no formal knowledge of programming so it is ideal for self-study.
Discrete Mathematics for Computer Science, Some Notes
This work begins with a discussion of the basic rules of mathematical reasoning and of the notion of proof formalized in a natural deduction system ``a la Prawitz''.
Principles and applications of algorithmic problem solving
This thesis rewrite material on elementary number theory and shows how the focus on the algorithmic content of the theory allows the systematisation of existing proofs and, more importantly, the construction of new knowledge in a practical and elegant way.
Computer Algebra and Symbolic Computation: Mathematical Methods
Maintaining the style set by Elementary Algorithms, the author explains mathematical methods as needed while introducing advanced methods to treat complex operations.
Computer Algebra and Symbolic Computation: Elementary Algorithms
The viewpoint is that mathematical expressions are the data objects of computer algebra programs, and by using a few primitive operations that analyze and construct expressions, the authors can implement many elementary operations from algebra, trigonometry, calculus, and differential equations.
Foundations of Data Science
Computer science as an academic discipline began in the 1960’s with emphasis on programming languages, compilers, operating systems, and the mathematical theory that supported these areas, but today, a fundamental change is taking place and the focus is more on applications.
Discrete Mathematics, Some Notes
These are notes on discrete mathematics for computer scientists that emphasize partial functions more than usual (after all, programs may not terminate for all input) and provide a fairly complete account of the basic concepts of graph theory.
Numerical Algorithmic Science and Engineering within Computer Science: Rationale, Foundations and Organization
A re-calibration is proposed for "numerical analysis" as it arises specifically within the broader, embracing field of modern computer science (CS). This would facilitate research into theoretical
The birth of a science
Physics, biology, chemistry, for example, do not already only study programs in many universities but are at the forefront of the development of science, and that is science itself. The development