Pages that link to "Item:Q856404"
From MaRDI portal
The following pages link to Robust gossiping with an application to consensus (Q856404):
Displaying 18 items.
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
- Quiescence of self-stabilizing gossiping among mobile agents in graphs (Q962163) (← links)
- Gossiping by processors prone to omission failures (Q976104) (← links)
- Communication-efficient randomized consensus (Q2075627) (← links)
- The logic of gossiping (Q2211849) (← links)
- Efficient gossip and robust distributed computation (Q2576871) (← links)
- Almost sure exponential convergence to consensus of random gossip algorithms (Q2847260) (← links)
- How Efficient Can Gossip Be? (On the Cost of Resilient Information Exchange) (Q3587432) (← links)
- Broadcast Gossip Algorithms for Consensus (Q4569760) (← links)
- Bounded Confidence Gossip Algorithms for Opinion Formation and Data Clustering (Q4629872) (← links)
- (Q5015383) (← links)
- Meeting the deadline (Q5176203) (← links)
- New bounds on the minimum number of calls in failure‐tolerant gossiping (Q5191126) (← links)
- Gossip Algorithms for Convex Consensus Optimization Over Networks (Q5347926) (← links)
- Asynchronous gossip (Q5395710) (← links)
- Distributed Computing (Q5897410) (← links)
- Fast agreement in networks with Byzantine nodes (Q6535029) (← links)
