Mathematics for Algorithm and Systems Analysis
by Edward A. Bender, S. Gill Williamson
Publisher: Dover Publications 2005
Number of pages: 256
Discrete mathematics is an essential tool in many areas of computer science. Problems in discrete mathematics arise in programming languages, computer architecture, networking, distributed systems, database systems, AI, theoretical computer science, and other areas. This up-to-date text assists undergraduates in mastering the ideas and mathematical language to address problems that arise in the field's many applications. It consists of 4 units of study: counting and listing, functions, decision trees and recursion, and basic concepts of graph theory.
Home page url
Download or read it online for free here:
(multiple PDF files)
by Justin Solomon - CRC Press
Using examples from a broad base of computational tasks, including data processing and computational photography, the book introduces numerical modeling and algorithmic design from a practical standpoint and provides insight into theoretical tools.
by Jean Gallier - Morgan Kaufmann
This book offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation that you can bring to bear on your own work -- whether you are a graduate student, scientist, or practitioner.
by Philip J. Koopman, Jr. - Academic Press
The results of cache-simulation experiments with an abstract machine for reducing combinator graphs are presented. The abstract machine, called TIGRE, exhibits reduction rates that compare favorably with previously reported techniques.
by Bhubaneswar Mishra - Courant Institute of Mathematical Sciences
The main purpose of the book is to acquaint advanced undergraduate and graduate students in computer science, engineering and mathematics with the algorithmic ideas in computer algebra so that they could do research in computational algebra.