Pages that link to "Item:Q1908347"
From MaRDI portal
The following pages link to The availability of quorum systems (Q1908347):
Displaying 27 items.
- Billiard quorums on the grid (Q287209) (← links)
- Optimal availability quorum systems: theory and practice (Q293249) (← links)
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks (Q660994) (← links)
- The availability of crumbling wall quorum systems (Q678870) (← links)
- A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data (Q1183495) (← links)
- Increasing the resilience of distributed and replicated database systems (Q1278039) (← links)
- Planar quorums (Q1575641) (← links)
- Local majorities, coalitions and monopolies in graphs: A review (Q1603713) (← links)
- Geographic quorum system approximations (Q1774150) (← links)
- Dynamic monopolies of constant size (Q1850560) (← links)
- Byzantine quorum systems with maximum availability. (Q1853046) (← links)
- Quorum systems constructed from combinatorial designs (Q1854450) (← links)
- Probabilistic quorum systems (Q1854466) (← links)
- Randomized registers and iterative algorithms (Q1953240) (← links)
- New heuristics for the multidimensional vote assignment problem (Q1969303) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Signed quorum systems (Q2375298) (← links)
- On quorum systems for group resources allocation (Q2377138) (← links)
- Concurrency and availability as dual properties of replicated atomic data (Q3474268) (← links)
- (Q4904139) (← links)
- Load balancing in quorum systems (Q5057420) (← links)
- Crumbling walls: a class of practical and efficient quorum systems (Q5137330) (← links)
- Synchronous Byzantine quorum systems (Q5137894) (← links)
- Access cost for asynchronous Byzantine quorum systems (Q5138348) (← links)
- Refined quorum systems (Q5401400) (← links)
- Average probe complexity in quorum systems (Q5920574) (← links)
- Planar quorums (Q6570922) (← links)
