Full-text indexes provide fast substring search over large text collections. A serious problem
of these indexes has traditionally been their space consumption. A recent trend is to develop …

A comprehensive update of the leading algorithms text, with new material on matchings in
bipartite graphs, online algorithms, machine learning, and other topics. Some books on …

Analytic combinatorics aims to enable precise quantitative predictions of the properties of
large combinatorial structures. The theory has emerged over recent decades as essential …

We present a survey of the fundamentals and the applications of sparse grids, with a focus
on the solution of partial differential equations (PDEs). The sparse grid approach, introduced …

Genetic programming (GP), one of the most advanced forms of evolutionary computation,
has been highly successful as a technique for getting computers to automatically solve …

Upper bounds on probabilities of large deviations for sums of bounded independent random
variables may be extended to handle functions which depend in a limited way on a number …

The combinatorial theory of species, introduced by Joyal in 1980, provides a unified
understanding of the use of generating functions for both labelled and unlabelled structures …

In combinatorics and analysis of algorithms a Poisson version of a problem (henceforth
called Poisson model or poissonization) is often easier to solve than the original one, which …

Before there were computers, there were algorithms. But now that there are computers, there
are even more algorithms, and algorithms lie at the heart of computing. This book provides a …

A comprehensive look at the emerging science of networks Network science helps you
design faster, more resilient communication networks; revise infrastructure systems such as …