Recommendations
Cited in
(32)- Byzantine quorum systems with maximum availability.
- Quorum systems constructed from combinatorial designs
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Concurrency and availability as dual properties of replicated atomic data
- On multilevel voting
- Planar quorums
- Increasing the resilience of distributed and replicated database systems
- Billiard quorums on the grid
- Geographic quorum system approximations
- Optimal availability quorum systems: theory and practice
- Crumbling walls: a class of practical and efficient quorum systems
- Local majorities, coalitions and monopolies in graphs: A review
- Analysis of quorum-based protocols for distributed (k+1)-exclusion
- Dynamic monopolies of constant size
- scientific article; zbMATH DE number 125485 (Why is no real title available?)
- Access cost for asynchronous Byzantine quorum systems
- Planar quorums
- A high availability \({\sqrt {N}}\) hierarchical grid algorithm for replicated data
- Probabilistic quorum systems
- Signed quorum systems
- A weighted voting algorithm for replicated directories
- Distributed Computing
- On quorum systems for group resources allocation
- Average probe complexity in quorum systems
- Randomized registers and iterative algorithms
- scientific article; zbMATH DE number 6131590 (Why is no real title available?)
- Load balancing in quorum systems
- How many cooks spoil the soup?
- New heuristics for the multidimensional vote assignment problem
- Refined quorum systems
- The availability of crumbling wall quorum systems
- Synchronous Byzantine quorum systems
This page was built for publication: The availability of quorum systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1908347)
