Scalable and dynamic quorum systems

DOI10.1145/872035.872052MaRDI QIDQ5892138zbMATH OpenOpenAlexFDO

Authors Moni Naor, Udi Wieder

Publication date 4 September 2015

Published in Proceedings of the twenty-second annual symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.5157

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15)

Recommendations

• Scalable and dynamic quorum systems
• Distributed Computing
• Probabilistic quorums for dynamic systems
• Probabilistic quorums for dynamic systems. (Extended abstract)
• How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems

Cited in

(14)

• Mutual exclusion in MANETs using quorum agreements
• Geographic quorum system approximations
• Probabilistic quorums for dynamic systems
• Signed quorum systems
• On quorum systems for group resources allocation
• scientific article; zbMATH DE number 6905205 (Why is no real title available?)
• How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
• Distributed Computing
• Refined quorum systems
• Fault-Tolerant Storage in a Dynamic Environment
• Average probe complexity in quorum systems
• Probabilistic quorums for dynamic systems. (Extended abstract)
• Scalable and dynamic quorum systems
• Average probe complexity in quorum systems

This page was built for publication: Scalable and dynamic quorum systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5892138)