Quorums from difference covers

DOI10.1016/S0020-0190(00)00080-6zbMath1339.68089OpenAlexW1980398471MaRDI QIDQ294779

Alan C. H. Ling, Charles J. Colbourn

Publication date: 16 June 2016

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S0020019000000806?np=y

zbMATH Keywords

distributed systemsdifference setmutual exclusiondifference coverquorum system

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (9)

Projective planes and congestion-free networks ⋮ On the Size of One-way Quantum Finite Automata with Periodic Behaviors ⋮ Time-Space Trade-Offs for Longest Common Extensions ⋮ Computing runs on a general alphabet ⋮ Time-space trade-offs for longest common extensions ⋮ GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA ⋮ The complexity of minimum difference cover ⋮ The alternating BWT: an algorithmic perspective ⋮ Mediated digraphs and quantum nonlocality

Cites Work

• Billiard quorums on the grid
• A Note on Restricted Difference Bases
• Unnamed Item

This page was built for publication: Quorums from difference covers