On the hardness of failure-sensitive agreement problems.
From MaRDI portal
Publication:1603446
DOI10.1016/S0020-0190(00)00171-XzbMath1052.68013WikidataQ127203163 ScholiaQ127203163MaRDI QIDQ1603446
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68M14: Distributed systems
Related Items
An Eventually Perfect Failure Detector for Networks of Arbitrary Topology Connected with ADD Channels Using Time-To-Live Values, Non-blocking atomic commit in asynchronous distributed systems with failure detectors, Extracting Symbolic Transitions from TLA$$^{+}$$+ Specifications, The perfectly synchronized round-based model of distributed computing, Higher-order quantifier elimination, counter simulations and fault-tolerant systems
Cites Work