Concrete Mathematics

Author: Ronald L. Graham
Publisher: Addison-Wesley Professional
ISBN: 0201558025
Release Date: 1994-01-01
Genre: Computers

This book, updated and improved, 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-looking sums, to solve complex recurrence relations, and to discover subtle patterns in data. It is an indispensable text and reference, not only for computer scientists but for all technical professionals in virtually every discipline.

Concrete mathematics

Author: Ronald L. Graham
Publisher: Addison Wesley Publishing Company
ISBN: UOM:39015028274325
Release Date: 1989
Genre: Mathematics

Fundamentals of Discrete Math for Computer Science

Author: Tom Jenkyns
Publisher: Springer Science & Business Media
ISBN: 9781447140696
Release Date: 2012-10-16
Genre: Computers

This textbook provides an engaging and motivational introduction to traditional topics in discrete mathematics, in a manner specifically designed to appeal to computer science students. The text empowers students to think critically, to be effective problem solvers, to integrate theory and practice, and to recognize the importance of abstraction. Clearly structured and interactive in nature, the book presents detailed walkthroughs of several algorithms, stimulating a conversation with the reader through informal commentary and provocative questions. Features: no university-level background in mathematics required; ideally structured for classroom-use and self-study, with modular chapters following ACM curriculum recommendations; describes mathematical processes in an algorithmic manner; contains examples and exercises throughout the text, and highlights the most important concepts in each section; selects examples that demonstrate a practical use for the concept in question.

Mathematics for the Analysis of Algorithms

Author: Daniel H. Greene
Publisher: Springer Science & Business Media
ISBN: 9780817647292
Release Date: 2009-05-21
Genre: Computers

This monograph collects some fundamental mathematical techniques that are required for the analysis of algorithms. It builds on the fundamentals of combinatorial analysis and complex variable theory to present many of the major paradigms used in the precise analysis of algorithms, emphasizing the more difficult notions. The authors cover recurrence relations, operator methods, and asymptotic analysis in a format that is concise enough for easy reference yet detailed enough for those with little background with the material.

Companion to Concrete Mathematics

Author: Z. A. Melzak
Publisher: Courier Corporation
ISBN: 9780486457819
Release Date: 2007-06-25
Genre: Mathematics

A two-volume treatment in a single binding, this supplementary text stresses intuitive appeal and ingenuity. It employs physical analogies, encourages problem formulation, and supplies problem-solving methods. 1973 and 1976 editions.

Foundation Mathematics for Computer Science

Author: John Vince
Publisher: Springer
ISBN: 9783319214375
Release Date: 2015-07-27
Genre: Computers

John Vince describes a range of mathematical topics to provide a foundation for an undergraduate course in computer science, starting with a review of number systems and their relevance to digital computers, and finishing with differential and integral calculus. Readers will find that the author's visual approach will greatly improve their understanding as to why certain mathematical structures exist, together with how they are used in real-world applications. Each chapter includes full-colour illustrations to clarify the mathematical descriptions, and in some cases, equations are also coloured to reveal vital algebraic patterns. The numerous worked examples will consolidate comprehension of abstract mathematical concepts. Foundation Mathematics for Computer Science covers number systems, algebra, logic, trigonometry, coordinate systems, determinants, vectors, matrices, geometric matrix transforms, differential and integral calculus, and reveals the names of the mathematicians behind such inventions. During this journey, John Vince touches upon more esoteric topics such as quaternions, octonions, Grassmann algebra, Barycentric coordinates, transfinite sets and prime numbers. Whether you intend to pursue a career in programming, scientific visualisation, systems design, or real-time computing, you should find the author’s literary style refreshingly lucid and engaging, and prepare you for more advanced texts.

A Short Course in Discrete Mathematics

Author: Edward A. Bender
Publisher: Courier Corporation
ISBN: 9780486439464
Release Date: 2005
Genre: Mathematics

What sort of mathematics do I need for computer science? In response to this frequently asked question, a pair of professors at the University of California at San Diego created this text. Its sources are two of the university's most basic courses: Discrete Mathematics, and Mathematics for Algorithm and System Analysis. Intended for use by sophomores in the first of a two-quarter sequence, the text assumes some familiarity with calculus. Topics include Boolean functions and computer arithmetic; logic; number theory and cryptography; sets and functions; equivalence and order; and induction, sequences, and series. Multiple choice questions for review appear throughout the text. Original 2005 edition. Notation Index. Subject Index.

Mathematics for Computer Science

Author: Eric Lehman
ISBN: 9888407066
Release Date: 2017-03-08

This book covers elementary discrete mathematics for computer science and engineering. It emphasizes mathematical definitions and proofs as well as applicable methods. Topics include formal logic notation, proof methods; induction, well-ordering; sets, relations; elementary graph theory; integer congruences; asymptotic notation and growth of functions; permutations and combinations, counting principles; discrete probability. Further selected topics may also be covered, such as recursive definition and structural induction; state machines and invariants; recurrences; generating functions.

Discrete Mathematics

Author: Martin Aigner
Publisher: American Mathematical Soc.
ISBN: 0821886150
Release Date:
Genre: Mathematics

The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints andsolutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level. Praise for the German edition ... This book is a well-written introduction to discrete mathematics and is highly recommended to every student ofmathematics and computer science as well as to teachers of these topics. --Konrad Engel for MathSciNet Martin Aigner is a professor of mathematics at the Free University of Berlin. He received his PhD at the University of Vienna and has held a number of positions in the USA and Germany before moving to Berlin. He is the author of several books on discrete mathematics, graph theory, and the theory of search. The Monthly article Turan's graph theorem earned him a 1995 Lester R. Ford Prize of theMAA for expository writing, and his book Proofs from the BOOK with Gunter M. Ziegler has been an international success with translations into 12 languages.

Introductory Discrete Mathematics

Author: V. K . Balakrishnan
Publisher: Courier Corporation
ISBN: 9780486140384
Release Date: 2012-04-30
Genre: Mathematics

This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.

The MMIX Supplement

Author: Martin Ruckert
Publisher: Addison-Wesley Professional
ISBN: 9780133992878
Release Date: 2015-05-19
Genre: Computers

The MMIX Supplement: Supplement to The Art of Computer Programming Volumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany.


Author: Donald Ervin Knuth
ISBN: UOM:39015000509920
Release Date: 1979
Genre: Computerized typesetting