The disagreement power of an adversary
From MaRDI portal
Publication:661056
DOI10.1007/S00446-010-0122-4zbMath1231.68071OpenAlexW2618013937MaRDI QIDQ661056
Hugues Fauconnier, Andreas Tielmann, Rachid Guerraoui, Carole Delporte-Gallet
Publication date: 6 February 2012
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-010-0122-4
Related Items (9)
A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ The topology of distributed adversaries ⋮ Power and limits of distributed computing shared memory models ⋮ Optimal algorithms for synchronous Byzantine \(k\)-set agreement ⋮ On set consensus numbers ⋮ The computational structure of progress conditions and shared objects ⋮ Wait-freedom with advice ⋮ Contention-related crash failures: definitions, agreement algorithms, and impossibility results
Cites Work
- Unnamed Item
- Anti-\(\Omega \): the weakest failure detector for set agreement
- More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
- On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
- The topological structure of asynchronous computability
- Impossibility of distributed consensus with one faulty process
- Atomic snapshots of shared memory
- Unreliable failure detectors for reliable distributed systems
- The weakest failure detector for solving consensus
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
This page was built for publication: The disagreement power of an adversary
