Threshold protocols in survivor set systems
From MaRDI portal
Publication:661005
Recommendations
Cites work
- Automatically increasing the fault-tolerance of distributed algorithms
- Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
- How to assign votes in a distributed system
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 1179121 (Why is no real title available?)
- scientific article; zbMATH DE number 1950668 (Why is no real title available?)
- scientific article; zbMATH DE number 1514781 (Why is no real title available?)
- scientific article; zbMATH DE number 1559572 (Why is no real title available?)
- Randomized wait-free concurrent objects (extended abstract)
- Refined quorum systems
- Simplifying fault-tolerance, providing the abstraction of crash failures
- The Byzantine Generals Problem
- The topological structure of asynchronous computability
- Unreliable failure detectors for reliable distributed systems
This page was built for publication: Threshold protocols in survivor set systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q661005)