Quorums from difference covers
From MaRDI portal
Publication:294779
DOI10.1016/S0020-0190(00)00080-6zbMATH Open1339.68089OpenAlexW1980398471MaRDI QIDQ294779FDOQ294779
Authors: 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
Recommendations
Cites Work
Cited In (12)
- Mediated digraphs and quantum nonlocality
- Projective planes and congestion-free networks
- Billiard quorums on the grid
- Time-Space Trade-Offs for Longest Common Extensions
- The complexity of minimum difference cover
- Computing runs on a general alphabet
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- A \(\sqrt {N \over G}\) method for generating communication
- The alternating BWT: an algorithmic perspective
- Time-space trade-offs for longest common extensions
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes
This page was built for publication: Quorums from difference covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q294779)