Pages that link to "Item:Q2943377"
From MaRDI portal
The following pages link to Coordinated consensus in dynamic networks (Q2943377):
Displaying 38 items.
- On the impact of link faults on Byzantine agreement (Q476176) (← links)
- Bounded-contention coding for the additive network model (Q748114) (← links)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391) (← links)
- Reset strategy for consensus in networks of clusters (Q905778) (← links)
- Overcoming the coordination problem: dynamic formation of networks (Q969125) (← links)
- Fast consensus seeking on networks with antagonistic interactions (Q1723085) (← links)
- Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks (Q1743719) (← links)
- Consensus in rooted dynamic networks with short-lived stability (Q2010603) (← links)
- The weakest failure detector for eventual consistency (Q2010607) (← links)
- Synchronization modulo \(P\) in dynamic networks (Q2110375) (← links)
- Some lower bounds in dynamic networks with oblivious adversaries (Q2174250) (← links)
- Distributed exploration of dynamic rings (Q2174251) (← links)
- Consensus formation in networks with neighbor-dependent synergy and observer effect (Q2219574) (← links)
- Exploration of dynamic networks: tight bounds on the number of agents (Q2229946) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- A characterization of oblivious message adversaries for which consensus is solvable (Q2345460) (← links)
- On the expressivity of time-varying graphs (Q2348032) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- A Characterization of Dynamic Networks Where Consensus Is Solvable (Q2868629) (← links)
- The Firing Squad Problem Revisited. (Q3304114) (← links)
- Approximate Consensus in Highly Dynamic Networks: The Role of Averaging Algorithms (Q3449502) (← links)
- Consensus Propagation (Q3548109) (← links)
- Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems (Q5207898) (← links)
- Consensus Problems on Networks With Antagonistic Interactions (Q5353176) (← links)
- Consensus and Coherence in Fractal Networks (Q5358431) (← links)
- (Q5743420) (← links)
- An Introduction to Temporal Graphs: An Algorithmic Perspective<sup>*</sup> (Q5856438) (← links)
- Smoothed analysis of dynamic networks (Q5915695) (← links)
- A topological perspective on distributed network algorithms (Q5919043) (← links)
- Gathering in dynamic rings (Q5919424) (← links)
- Non-preemptive tree packing (Q5925632) (← links)
- Blockchain in dynamic networks (Q6155240) (← links)
- Round-Oblivious Stabilizing Consensus in Dynamic Networks (Q6488436) (← links)
- Synchronization Modulo k in Dynamic Networks (Q6488455) (← links)
- Models of smoothing in dynamic networks (Q6535035) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
- Sublinear algorithms in \(T\)-interval dynamic networks (Q6614112) (← links)