Analysis of an election problem for CSCW in asynchronous distributed systems
From MaRDI portal
Recommendations
- The weakest failure detector for solving election problems in asynchronous distributed systems
- About the relationship between election problem and failure detector in asynchronous distributed systems
- Solving Election Problem in Asynchronous Distributed Systems
- The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
- Unreliable failure detectors for reliable distributed systems
Cited in
(5)- Solving Election Problem in Asynchronous Distributed Systems
- The Election Problem in Asynchronous Distributed Systems with Bounded Faulty Processes
- The weakest failure detector for solving election problems in asynchronous distributed systems
- About the relationship between election problem and failure detector in asynchronous distributed systems
- An efficient election protocol in a mobile computing environment
This page was built for publication: Analysis of an election problem for CSCW in asynchronous distributed systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4412190)