Quorum systems constructed from combinatorial designs

DOI10.1006/inco.2001.3044zbMath1005.05009OpenAlexW1972446935MaRDI QIDQ1854450

Charles J. Colbourn, Jeffrey H. Dinitz, Douglas R. Stinson

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/85f15f6a8149ff9989a10355221e1bafd946c328

zbMATH Keywords

balanced incomplete block designsfailure polynomials

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)

Related Items (2)

Relative blocking in posets ⋮ Generalized covering designs and clique coverings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Billiard quorums on the grid
• Some results on quadrilaterals in Steiner triple systems
• The availability of quorum systems
• The Complexity of Enumeration and Reliability Problems
• Load Balancing in Quorum Systems
• The Load, Capacity, and Availability of Quorum Systems
• Construction Techniques for Anti-Pasch Steiner Triple Systems
• A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs

This page was built for publication: Quorum systems constructed from combinatorial designs