Refined quorum systems
From MaRDI portal
Publication:992512
DOI10.1007/s00446-010-0103-7zbMath1231.68079OpenAlexW1974485145MaRDI QIDQ992512
Marko Vukolić, Rachid Guerraoui
Publication date: 9 September 2010
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-010-0103-7
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On interprocess communication. I: Basic formalism
- Round-by-round fault detectors (extended abstract)
- Fault-tolerant wait-free shared objects
- Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions
- Amnesic Distributed Storage
- Impossibility of distributed consensus with one faulty process
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- A method for obtaining digital signatures and public-key cryptosystems
- Time, clocks, and the ordering of events in a distributed system
- Sharing memory robustly in message-passing systems
- Unreliable failure detectors for reliable distributed systems
- The Load, Capacity, and Availability of Quorum Systems
- Indulgent algorithms (preliminary version)
- Quorum placement in networks
- Timeliness, failure-detectors, and consensus performance
- How fast can a very robust read be?
- Randomized wait-free concurrent objects (extended abstract)
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- Refined quorum systems
- How fast can a distributed atomic read be?
This page was built for publication: Refined quorum systems
