Access cost for asynchronous Byzantine quorum systems
From MaRDI portal
Publication:5138348
DOI10.1007/PL00008925zbMATH Open1448.68071OpenAlexW2093581714MaRDI QIDQ5138348FDOQ5138348
Authors: Rida A. Bazzi
Publication date: 3 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00008925
Recommendations
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)
Cites Work
- Title not available (Why is that?)
- Byzantine quorum systems
- The availability of quorum systems
- How to assign votes in a distributed system
- The Load, Capacity, and Availability of Quorum Systems
- Title not available (Why is that?)
- Planar quorums
- How to be an efficient snoop, or the probe complexity of quorum systems (extended abstract)
- Synchronous Byzantine quorum systems
Cited In (1)
This page was built for publication: Access cost for asynchronous Byzantine quorum systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5138348)