Signed quorum systems
From MaRDI portal
Publication:2375298
DOI10.1007/s00446-005-0133-8zbMath1266.68122OpenAlexW2723060054MaRDI QIDQ2375298
Publication date: 13 June 2013
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-005-0133-8
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14)
Cites Work
- Unnamed Item
- Planar quorums
- Probabilistic quorum systems
- The availability of quorum systems
- How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
- How to assign votes in a distributed system
- Load Balancing in Quorum Systems
- The Load, Capacity, and Availability of Quorum Systems
- Average probe complexity in quorum systems
- Scalable and dynamic quorum systems
This page was built for publication: Signed quorum systems