Pages that link to "Item:Q2445150"
From MaRDI portal
The following pages link to Analysis of accelerated gossip algorithms (Q2445150):
Displaying 11 items.
- Average consensus on general strongly connected digraphs (Q694804) (← links)
- Request-based gossiping without deadlocks (Q1797048) (← links)
- Characterizing limits and opportunities in speeding up Markov chain mixing (Q2029783) (← links)
- Gossip over holonomic graphs (Q2063863) (← links)
- Convergence rate on periodic gossiping (Q2282871) (← links)
- An enhanced Gossip algorithm based on superposition coding (Q2927299) (← links)
- Linear Time Average Consensus and Distributed Optimization on Fixed Graphs (Q4599719) (← links)
- Accelerated Gossip in Networks of Given Dimension Using Jacobi Polynomial Iterations (Q5027016) (← links)
- Analyzing network coding gossip made easy (Q5419099) (← links)
- A dual approach for optimal algorithms in distributed optimization over networks (Q5859014) (← links)
- Acceleration of gossip algorithms through the Euler–Poisson–Darboux Equation (Q5878157) (← links)