Applications of combinatorial designs in computer science

Charles Colbourn, Paul C. van Oorschot

Research output: Contribution to journalArticle

25 Citations (Scopus)

Abstract

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.

Original languageEnglish (US)
Pages (from-to)223-250
Number of pages28
JournalComputing Surveys
Volume21
Issue number2
StatePublished - Jun 1989
Externally publishedYes

Fingerprint

Combinatorial Design
Computer science
Computer Science
Algorithm Design and Analysis
Design and Analysis of Algorithms
Balancing
Paradigm
Hardware
Computing
Design

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Applications of combinatorial designs in computer science. / Colbourn, Charles; van Oorschot, Paul C.

In: Computing Surveys, Vol. 21, No. 2, 06.1989, p. 223-250.

Research output: Contribution to journalArticle

Colbourn, C & van Oorschot, PC 1989, 'Applications of combinatorial designs in computer science', Computing Surveys, vol. 21, no. 2, pp. 223-250.
Colbourn, Charles ; van Oorschot, Paul C. / Applications of combinatorial designs in computer science. In: Computing Surveys. 1989 ; Vol. 21, No. 2. pp. 223-250.
@article{ba9ffc35e78b49caa33c03e87f45cf71,
title = "Applications of combinatorial designs in computer science",
abstract = "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.",
author = "Charles Colbourn and {van Oorschot}, {Paul C.}",
year = "1989",
month = "6",
language = "English (US)",
volume = "21",
pages = "223--250",
journal = "ACM Computing Surveys",
issn = "0360-0300",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - Applications of combinatorial designs in computer science

AU - Colbourn, Charles

AU - van Oorschot, Paul C.

PY - 1989/6

Y1 - 1989/6

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0024683642&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0024683642&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0024683642

VL - 21

SP - 223

EP - 250

JO - ACM Computing Surveys

JF - ACM Computing Surveys

SN - 0360-0300

IS - 2

ER -