This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for
nonspecialists. There is a strong emphasis on theorems with particularly elegant and …

Covering arrays generalize orthogonal arrays by requiring that t-tuples be covered, but not
requiring that the appearance of t-tuples be balanced. Their uses in screening experiments …

In the 21 st century our society is becoming more and more dependent on software systems.
The safety of these systems and the quality of our lives is increasingly dependent on the …

(L, d)-universal sets are useful for exhaustively testing logic circuits with a large number of
functional components, designed so that every functional component depends on at most d …

A t‐covering array is a set of k binary vectors of length n with the property that, in any t
coordinate positions, all 2t possibilities occur at least once. Such arrays are used for …

The identification of interaction faults in component-based systems has focused on
indicating the presence of faults, rather than their location and magnitude. While this is a …

Given a type of resource such as disk units, extra memory modules, connections to the host
processor, or software modules, we consider the problem of distributing the resource units to …

We develop in this paper a simple way of generating a test set which simultaneously
provides exhaustive pattern testing with respect to all input subsets of a logic circuit up to a …

Binary covering arrays of strength $ t $ are 0–1 matrices having the property that for each $ t
$ columns and each of the possible $2^ t $ sequences of $ t $ 0's and 1's, there exists a row …

The explicit construction of covering arrays arises in many disparate applications in which
factors or components interact. Despite this, current computational tools are effective only …