The theory of combinatorial designs has been used in widely different areas of computation concerned with the design and analysis of both algorithms and hardware. Combinatorial designs capture a subtle balancing property that is inherent in many difficult problems and hence can provide a sophisticated tool for addressing these problems. The role of combinatorial designs in solving many problems that are basic to the field of computing is explored in this paper. Case studies of many applications of designs to computation are given; these constitute a first survey, which provides a representative sample of uses of designs. More importantly, they suggest paradigms in which designs can be used profitably in algorithm design and analysis.

Additional Metadata
Keywords Authentication, combinatorial design, distributed consensus, file organization, intercommunication networks, memory access, parallel algorithms, parallel sorting
Persistent URL dx.doi.org/10.1145/66443.66446
Journal ACM Computing Surveys
Citation
Colbourn, C.J. (Charles J.), & Van Oorschot, P. (1989). Applications of combinatorial designs in computer science. ACM Computing Surveys, 21(2), 223–250. doi:10.1145/66443.66446