Average probe complexity in quorum systems

DOI10.1145/383962.384014MaRDI QIDQ5890495zbMATH OpenOpenAlexFDO

Authors Yehuda Hassin, David Peleg

Publication date 4 March 2016

Published in Proceedings of the twentieth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/383962.384014

Mathematics Subject Classification ID

Distributed systems (68M14) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Average probe complexity in quorum systems
• How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
• Signed quorum systems
• Distributed Computing
• Scalable and dynamic quorum systems

Cited in

(3)

• Signed quorum systems
• How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
• Average probe complexity in quorum systems

This page was built for publication: Average probe complexity in quorum systems

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