Quorums from difference covers
From MaRDI portal
Recommendations
Cites work
Cited in
(17)- Projective planes and congestion-free networks
- A simple scheme to construct \(k\)-coteries with \(O(\sqrt{N})\) uniform quorum sizes
- The alternating BWT: an algorithmic perspective
- Time-space trade-offs for longest common extensions
- The complexity of minimum difference cover
- A \(\sqrt {N \over G}\) method for generating communication
- Mediated digraphs and quantum nonlocality
- Billiard quorums on the grid
- Time-Space Trade-Offs for Longest Common Extensions
- On the Size of One-way Quantum Finite Automata with Periodic Behaviors
- GOLOMB RULERS AND DIFFERENCE SETS FOR SUCCINCT QUANTUM AUTOMATA
- Longest common substring with gaps and related problems
- Two-dimensional longest common extension queries in compact space
- String problems in the congested clique model
- Fast and lightweight distributed suffix array construction
- String problems in the congested clique model
- Computing runs on a general alphabet
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)