Average probe complexity in quorum systems

DOI10.1016/J.JCSS.2005.10.003zbMath1094.68115OpenAlexW1975335288MaRDI QIDQ5920574

Yehuda Hassin, David Peleg

Publication date: 30 June 2006

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2005.10.003

zbMATH Keywords

quorum systemsprobe complexitynondominated coteries

Mathematics Subject Classification ID

Randomized algorithms (68W20)

Related Items (1)

Scalable and dynamic quorum systems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The availability of quorum systems
• Optimal Search on Some Game Trees
• How to assign votes in a distributed system
• Load Balancing in Quorum Systems
• The Load, Capacity, and Availability of Quorum Systems
• How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
• Crumbling walls: a class of practical and efficient quorum systems

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