ResearchTrend.AI
  • Communities
  • Connect sessions
  • AI calendar
  • Organizations
  • Join Slack
  • Contact Sales
Papers
Communities
Social Events
Terms and Conditions
Pricing
Contact Sales
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2026 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1206.0992
  4. Cited By
Finite-time Convergent Gossiping
v1v2v3v4v5v6 (latest)

Finite-time Convergent Gossiping

IEEE/ACM Transactions on Networking (TON), 2012
5 June 2012
Guodong Shi
Bo Li
M. Johansson
Karl H. Johansson
ArXiv (abs)PDFHTML

Papers citing "Finite-time Convergent Gossiping"

7 / 7 papers shown
Beyond Exponential Graph: Communication-Efficient Topologies for
  Decentralized Learning via Finite-time Convergence
Beyond Exponential Graph: Communication-Efficient Topologies for Decentralized Learning via Finite-time ConvergenceNeural Information Processing Systems (NeurIPS), 2023
Yuki Takezawa
Ryoma Sato
Han Bao
Kenta Niwa
M. Yamada
256
16
0
19 May 2023
Exponential Graph is Provably Efficient for Decentralized Deep Training
Exponential Graph is Provably Efficient for Decentralized Deep Training
Bicheng Ying
Kun Yuan
Yiming Chen
Hanbin Hu
Pan Pan
W. Yin
FedML
228
105
0
26 Oct 2021
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip
  Algorithms
Dynamical Privacy in Distributed Computing -- Part II: PPSC Gossip Algorithms
Yang Liu
Junfeng Wu
I. Manchester
Guodong Shi
151
2
0
01 Aug 2018
Quantum Clique Gossiping
Quantum Clique Gossiping
Bo Li
Shuang Li
Junfeng Wu
Hongsheng Qi
GNN
117
5
0
04 Dec 2017
Clique Gossiping
Clique GossipingIEEE/ACM Transactions on Networking (TON), 2017
Yang Liu
Bo Li
Brian D. O. Anderson
Guodong Shi
105
10
0
08 Jun 2017
Finite-time consensus using stochastic matrices with positive diagonals
Finite-time consensus using stochastic matrices with positive diagonalsIEEE Transactions on Automatic Control (IEEE TAC), 2013
Julien Hendrickx
Guodong Shi
Karl H. Johansson
233
68
0
27 Feb 2013
Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for
  Almost Sure Convergence
Consensus over Random Graph Processes: Network Borel-Cantelli Lemmas for Almost Sure ConvergenceIEEE Transactions on Information Theory (IEEE Trans. Inf. Theory), 2011
Guodong Shi
Brian D. O. Anderson
Karl H. Johansson
371
42
0
06 Dec 2011
1