Probabilistic quorum systems

DOI10.1006/inco.2001.3054zbMath1005.68017OpenAlexW2113954151MaRDI QIDQ1854466

Dahlia Malkhi, Michael K. Reiter, Avishai Wool, Rebecca N. Wright

Publication date: 14 January 2003

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/inco.2001.3054

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items

Diffusion without false rumors: On propagating updates in a Byzantine environment. ⋮ Signed quorum systems ⋮ Leader election in well-connected graphs ⋮ Probabilistic quorums for dynamic systems ⋮ Randomized leader election ⋮ Bosco: One-Step Byzantine Asynchronous Consensus ⋮ How Many Cooks Spoil the Soup? ⋮ How many cooks spoil the soup?

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On interprocess communication. II: Algorithms
• The tail of the hypergeometric distribution
• Planar quorums
• 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
• The Load, Capacity, and Availability of Quorum Systems
• The Load and Availability of Byzantine Quorum Systems
• Chernoff–Hoeffding Bounds for Applications with Limited Independence
• Crumbling walls: a class of practical and efficient quorum systems
• Secure reliable multicast protocols in a WAN
• Probability Inequalities for Sums of Bounded Random Variables
• Optimal multi-writer multi-reader atomic register
• Synchronous Byzantine quorum systems
• Probabilistic quorum systems