Pages that link to "Item:Q3642868"
From MaRDI portal
The following pages link to Impossibility Results and Lower Bounds for Consensus under Link Failures (Q3642868):
Displaying 20 items.
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- Randomization can be a healer: consensus with dynamic omission failures (Q661060) (← links)
- Synchronous consensus under hybrid process and link failures (Q719299) (← links)
- Tight bound on mobile Byzantine agreement (Q897904) (← links)
- Distributed sequential consensus in networks: analysis of partially connected blockchains with uncertainty (Q1687429) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Booting clock synchronization in partially synchronous systems with hybrid process and link failures (Q1954236) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- A Characterization of Dynamic Networks Where Consensus Is Solvable (Q2868629) (← links)
- Consensus vs. Broadcast in Communication Networks with Arbitrary Mobile Omission Faults (Q3088334) (← links)
- (Q5090896) (← links)
- (Q5091093) (← links)
- Distributed computations in fully-defective networks (Q6091854) (← links)
- Round-Oblivious Stabilizing Consensus in Dynamic Networks (Q6488436) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
- Sublinear algorithms in \(T\)-interval dynamic networks (Q6614112) (← links)
