Impossibility of distributed consensus with one faulty process
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
- Genuine atomic multicast in asynchronous distributed systems
- Synchronous consensus with optimal asynchronous fallback guarantees
- Generic proofs of consensus numbers for abstract data types
- Communication-efficient failure detection and consensus in omission environments
- Interplay between (im)perfectness, synchrony and connectivity: the case of reliable message transmission
- Computing with infinitely many processes
- Solving the at-most-once problem with nearly optimal effectiveness
- A non-topological proof for the impossibility of \(k\)-set agreement
- Power and limits of distributed computing shared memory models
- Wait-free implementations in message-passing systems
- Synchronous, with a chance of partition tolerance
- A survey on reliability in distributed systems
- Synchronization and informational agreement in distributed computing systems
- Anomalies and similarities among consensus numbers of variously-relaxed queues
- The renaming problem in shared memory systems: an introduction
- Byzantine-resistant total ordering algorithms.
- The power of multiobjects.
- Stopping times of distributed consensus protocols: a probabilistic analysis
- Wait-free linearization with an assertional proof
- Characterizing Consensus in the Heard-Of Model
- Necessity of parameter randomization in quantum contract signing
- Generalized Irreducibility of Consensus and the Equivalence of t-Resilient and Wait-Free Implementations of Consensus
- Minimal counterexamples for linear-time probabilistic verification
- When is recoverable consensus harder than consensus?
- Lattice agreement in message passing systems
- On the complexity of basic abstractions to implement consensus
- Bounds on tradeoffs between randomness and communication complexity
- Asynchronous agreement on a core set in constant expected time and more efficient asynchronous VSS and MPC
- On modelling mobility
- Stability of multi-valued continuous consensus
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
- Agreement in synchronous networks with ubiquitous faults
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- Non-blocking atomic commit in asynchronous distributed systems with failure detectors
- On the coordinator's rule for Fast Paxos
- Making Byzantine consensus live
- \textsc{Rambo}: a robust, reconfigurable atomic memory service for dynamic networks
- Asynchronous reconfiguration with Byzantine failures
- Making Byzantine consensus live
- Robust gossiping with an application to consensus
- Optimal strategies for selecting coordinators
- A constructive proof for FLP
- A topological perspective on distributed network algorithms
- Automated test case generation for the paxos single-decree protocol using a coloured Petri net model
- scientific article; zbMATH DE number 1950669 (Why is no real title available?)
- On the minimal synchronism needed for distributed consensus
- Distributed consensus, revisited
- Towards a Theory of Consistency Primitives
- Byzantine lattice agreement in synchronous message passing systems
- On the power of shared object types to implement one-resilient consensus
- Objects shared by Byzantine processes
- Restricted failure detectors: Definition and reduction protocols
- scientific article; zbMATH DE number 7561256 (Why is no real title available?)
- scientific article; zbMATH DE number 7561269 (Why is no real title available?)
- Fast timing-based algorithms
- scientific article; zbMATH DE number 7561443 (Why is no real title available?)
- On the power of breakable objects
- Broadcast using certified propagation algorithm in presence of Byzantine faults
- The computational power of distributed shared-memory models with bounded-size registers
- Open consensus
- Asynchronous Byzantine agreement with optimal resilience
- Using knowledge to optimally achieve coordination in distributed systems
- Dissecting distributed coordination
- Asynchronous self-stabilization made fast, simple, and energy-efficient
- Brief announcement: Communication-optimal convex agreement
- Brief announcement: No broadcast abstraction characterizes k-set-agreement in message-passing systems
- Nearly-optimal consensus tolerating adaptive omissions: why a lot of randomness is needed?
- The fractional spending problem: executing payment transactions in parallel with less than f+1 validations
- Probabilistic Byzantine fault tolerance
- All Byzantine agreement problems are expensive
- Brief announcement: Randomized consensus: common coins are not the Holy Grail!
- Determining recoverable consensus numbers
- Keynote: Time is not a healer: before and after
- Making local algorithms wait-free: the case of ring coloring
- An impossibility about failure detectors in the iterated immediate snapshot model
- Authenticated Byzantine generals in dual failure model
- Efficient parallel algorithms can be made robust
- Generalized Universality
- Some impossibility results in interprocess synchronization
- A topological treatment of early-deciding set-agreement
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- scientific article; zbMATH DE number 1950666 (Why is no real title available?)
- scientific article; zbMATH DE number 1950670 (Why is no real title available?)
- Byzantizing Paxos by refinement
- A knowledge-theoretic analysis of uniform distributed coordination and failure detectors
- Lower bounds for asynchronous consensus
- Classifying rendezvous tasks of arbitrary dimension
- Distributed computing in asynchronous networks with byzantine edges
- Collapsibility of read/write models using discrete Morse theory
- Wait-free computing
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Necessary and sufficient conditions of stationary average consensus for second-order multi-agent systems
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- Accountable safety implies finality (short paper)
- Reconciling fault-tolerant distributed computing and systems-on-chip
- No double discount: condition-based simultaneity yields limited gain
- Asynchronous process calculi: The first- and higher-order paradigms
- On the minimum requirements for independent recovery in distributed systems
- The topology of look-compute-move robot wait-free algorithms with hard termination
This page was built for publication: Impossibility of distributed consensus with one faulty process
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3766835)
