A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.

A groundbreaking conception of interactive media, inspired by continuity, field, and process, with fresh implications for art, computer science, and philosophy of technology.

A thorough exposition of quantum computing and the underlying concepts of quantum physics, with explanations of the relevant mathematics and numerous examples.

An introduction to many mathematical topics applicable to quantitative finance that teaches how to “think in mathematics” rather than simply do mathematics by rote.

As a result of a lunchtime conversation with Professor Wendell Garner concerning the productiveness of the sacrifice bunt, Earnshaw Cook took on the three-year task of presenting a formal analysis of baseball. His analysis, explained in terms perfectly clear to anyone with college freshman level mathematics, suggests that no one has ever known the true percentages, and if anyone did know them he could manage almost any team into the top ranks of major league baseball.

In writing the first book-length study of ancient Egyptian mathematics, Richard Gillings presents evidence that Egyptian achievements in this area are much more substantial than has been previously thought. He does so in a way that will interest not only historians of Egypt and of mathematics, but also people who simply like to manipulate numbers in novel ways. He examines all the extant sources, with particular attention to the most extensive of these—the Rhind Mathematical Papyrus, a collection of training exercises for scribes.

Richard Brauer (1901-1977) was one of the leading algebraists of this century. Although he contributed to a number of mathematical fields, Brauer devoted the major share of his efforts to the study of finite groups, a subject of considerable abstract interest and one that underlies many of the more recent advances in combinatorics and finite geometries.

This book presents, within a conceptually unified theoretical framework, a body of methods that have been developed over the past fifteen years for building and simulating qualitative models of physical systems—bathtubs, tea kettles, automobiles, the physiology of the body, chemical processing plants, control systems, electrical systems—where knowledge of that system is incomplete. The primary tool for this work is the author's QSIM algorithm, which is discussed in detail.

Women Becoming Mathematicians looks at the lives and careers of thirty-six of the approximately two hundred women who earned Ph.D.s in mathematics from American institutions from 1940 to 1959. During this period, American mathematical research enjoyed an unprecedented expansion, fueled by the technological successes of World War II and the postwar boom in federal funding for education in the basic sciences. Yet women's share of doctorates earned in mathematics in the United States reached an all-time low.

Nature has secrets, and it is the desire to uncover them that motivates the scientific quest. But what makes these "secrets" secret? Is it that they are beyond human ken? that they concern divine matters? And if they are accessible to human seeking, why do they seem so carefully hidden? Such questions are at the heart of Peter Pesic's enlightening effort to uncover the meaning of modern science.

A major problem in modern probabilistic modeling is the huge computational complexity involved in typical calculations with multivariate probability distributions when the number of random variables is large. Because exact computations are infeasible in such cases and Monte Carlo sampling techniques may reach their limits, there is a need for methods that allow for efficient approximate computations. One of the simplest approximations is based on the mean field method, which has a long history in statistical physics.

In The Art of Causal Conjecture, Glenn Shafer lays out a new mathematical and philosophical foundation for probability and uses it to explain concepts of causality used in statistics, artificial intelligence, and philosophy.

Algorithmic Number Theory provides a thorough introduction to the design and analysis of algorithms for problems from the theory of numbers. Although not an elementary textbook, it includes over 300 exercises with suggested solutions. Every theorem not proved in the text or left as an exercise has a reference in the notes section that appears at the end of each chapter. The bibliography contains over 1,750 citations to the literature.

Algebraic Semantics of Imperative Programs presents a self-contained and novel "executable" introduction to formal reasoning about imperative programs. The authors' primary goal is to improve programming ability by improving intuition about what programs mean and how they run.

The semantics of imperative programs is specified in a formal, implemented notation, the language OBJ; this makes the semantics highly rigorous yet simple, and provides support for the mechanical verification of program properties.