The Load and Availability of Byzantine Quorum Systems
From MaRDI portal
Publication:4507330
DOI10.1137/S0097539797325235zbMath1136.68334OpenAlexW1976188138MaRDI QIDQ4507330
Michael K. Reiter, Avishai Wool, Dahlia Malkhi
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797325235
Database theory (68P15) Network design and communication in computer systems (68M10) Combinatorics in computer science (68R05) Voting theory (91B12) Distributed systems (68M14)
Related Items (3)
On quorum systems for group resources allocation ⋮ Byzantine quorum systems with maximum availability. ⋮ Probabilistic quorum systems
This page was built for publication: The Load and Availability of Byzantine Quorum Systems