लेखक: Joel Spencer

Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume …

This beautiful book is about how to estimate large quantities-and why. Building on nothing more than first-year calculus, it goes all the way into deep asymptotical methods and shows how these can be …

…

The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a short range in which …

Finite model theory, as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational …