Fault-tolerant message-passing distributed systems. An algorithmic approach
From MaRDI portal
Recommendations
Cited in
(36)- A network-failure-tolerant message-passing system for terascale clusters
- A fault-tolerant message passing algorithm and its hardware implementation
- Byzantine-tolerant causal broadcast
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Crash-tolerant causal broadcast in \(O(n)\) messages
- Distributed Algorithms for Message-Passing Systems
- Distributed Systems
- Message-optimal protocols for fault-tolerant broadcasts/multicasts in distributed systems with crash failures
- How to Simulate Message-Passing Algorithms in Mobile Agent Systems with Faults
- An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
- On the versatility of Bracha's Byzantine reliable broadcast algorithm
- A simple object that spans the whole consensus hierarchy
- Synchronous \(t\)-resilient consensus in arbitrary graphs
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
- Asynchronous Byzantine reliable broadcast with a message adversary
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement
- Reaching agreement in the presence of contention-related crash failures
- Fault-tolerant graph realizations in the congested clique
- Optimal algorithms for synchronous Byzantine \(k\)-set agreement
- Reaching consensus in the presence of contention-related crash failures
- Self-stabilizing Byzantine fault-tolerant repeated reliable broadcast
- About informatics, distributed computing, and our job: a personal view
- Self-stabilizing indulgent zero-degrading binary consensus
- Brief Announcement: The MBroadcast Abstraction
- Byzantine-Tolerant Reliable Broadcast in the Presence of Silent Churn
- Synchronous t-resilient consensus in arbitrary graphs
- Good-case early-stopping latency of synchronous Byzantine reliable broadcast: the deterministic case
- Process-commutative distributed objects: from cryptocurrencies to Byzantine-fault-tolerant CRDTs
- Self-stabilizing multivalued consensus in asynchronous crash-prone systems
- Byzantine reliable broadcast and tendermint consensus with trusted components
- A speedup theorem for asynchronous computation with applications to consensus and approximate agreement
- Keynote: Time is not a healer: before and after
- Self-stabilizing multivalued consensus in the presence of Byzantine faults and asynchrony
- Byzantine-tolerant distributed grow-only sets: specification and applications
This page was built for publication: Fault-tolerant message-passing distributed systems. An algorithmic approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237451)
