ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1104.2944
  4. Cited By
Global Computation in a Poorly Connected World: Fast Rumor Spreading
  with No Dependence on Conductance

Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance

14 April 2011
K. Censor-Hillel
Bernhard Haeupler
Jonathan A. Kelner
P. Maymounkov
    LRM
ArXiv (abs)PDFHTML

Papers citing "Global Computation in a Poorly Connected World: Fast Rumor Spreading with No Dependence on Conductance"

28 / 28 papers shown
Title
The Singular Optimality of Distributed Computation in LOCAL
The Singular Optimality of Distributed Computation in LOCAL
Fabien Dufoulon
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
76
2
0
11 Nov 2024
Time- and Communication-Efficient Overlay Network Construction via
  Gossip
Time- and Communication-Efficient Overlay Network Construction via Gossip
Fabien Dufoulon
Michael Moorman
W. Moses
Gopal Pandurangan
61
2
0
28 Nov 2023
Randomized Rumor Spreading Revisited (Long Version)
Randomized Rumor Spreading Revisited (Long Version)
Benjamin Doerr
Anatolii Kostrygin
15
0
0
20 Mar 2023
Flooding with Absorption: An Efficient Protocol for Heterogeneous
  Bandits over Complex Networks
Flooding with Absorption: An Efficient Protocol for Heterogeneous Bandits over Complex Networks
Junghyun Lee
Laura Schmid
Se-Young Yun
68
0
0
09 Mar 2023
On the Hierarchy of Distributed Majority Protocols
On the Hierarchy of Distributed Majority Protocols
Petra Berenbrink
A. Coja-Oghlan
Oliver Gebhard
Max Hahn-Klimroth
Dominik Kaaser
M. Rau
41
3
0
17 May 2022
Early Adapting to Trends: Self-Stabilizing Information Spread using
  Passive Communication
Early Adapting to Trends: Self-Stabilizing Information Spread using Passive Communication
Amos Korman
Robin Vacus
56
5
0
22 Mar 2022
Fast Consensus via the Unconstrained Undecided State Dynamics
Fast Consensus via the Unconstrained Undecided State Dynamics
Gregor Bankhamer
Petra Berenbrink
Felix Biermeier
Robert Elsässer
Hamed Hosseinpour
Dominik Kaaser
Peter Kling
91
12
0
18 Mar 2021
The Local Information Cost of Distributed Graph Spanners
The Local Information Cost of Distributed Graph Spanners
Peter Robinson
75
0
0
22 Mar 2020
Message Reduction in the Local Model is a Free Lunch
Message Reduction in the Local Model is a Free Lunch
Shimon Bitton
Y. Emek
Taisuke Izumi
S. Kutten
LRM
41
4
0
18 Sep 2019
Randomized Rumor Spreading in Ad Hoc Networks with Buffers
Randomized Rumor Spreading in Ad Hoc Networks with Buffers
Dariusz R. Kowalski
Christopher Thraves
16
0
0
31 Dec 2018
Finding a Bounded-Degree Expander Inside a Dense One
Finding a Bounded-Degree Expander Inside a Dense One
L. Becchetti
A. Clementi
Emanuele Natale
F. Pasquale
Luca Trevisan
35
7
0
26 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Ya-Ping Hsieh
Chen Liu
Volkan Cevher
65
4
0
05 Nov 2018
Limits for Rumor Spreading in stochastic populations
Limits for Rumor Spreading in stochastic populations
Lucas Boczkowski
O. Feinerman
Amos Korman
Emanuele Natale
58
12
0
20 Dec 2017
Rational Fair Consensus in the GOSSIP Model
Rational Fair Consensus in the GOSSIP Model
A. Clementi
Luciano Gualà
Guido Proietti
Giacomo Scornavacca
44
5
0
26 May 2017
Slow links, fast links, and the cost of gossip
Slow links, fast links, and the cost of gossip
S. Sourav
Peter Robinson
Seth Gilbert
50
10
0
19 Nov 2016
Distributed Construction of Purely Additive Spanners
Distributed Construction of Purely Additive Spanners
K. Censor-Hillel
T. Kavitha
A. Paz
Amir Yehudayoff
38
27
0
19 Jul 2016
Minimizing Message Size in Stochastic Communication Patterns: Fast
  Self-Stabilizing Protocols with 3 bits
Minimizing Message Size in Stochastic Communication Patterns: Fast Self-Stabilizing Protocols with 3 bits
Lucas Boczkowski
Amos Korman
Emanuele Natale
77
30
0
14 Feb 2016
Rumor Spreading with Bounded In-Degree
Rumor Spreading with Bounded In-Degree
Sebastian Daum
Fabian Kuhn
Yannic Maus
23
26
0
02 Jun 2015
Plurality Consensus in the Gossip Model
Plurality Consensus in the Gossip Model
L. Becchetti
A. Clementi
Emanuele Natale
F. Pasquale
R. Silvestri
96
78
0
09 Jul 2014
Optimal Gossip with Direct Addressing
Optimal Gossip with Direct Addressing
Bernhard Haeupler
Dahlia Malkhi
56
11
0
12 Feb 2014
Breathe before Speaking: Efficient Information Dissemination Despite
  Noisy, Limited and Anonymous Communication
Breathe before Speaking: Efficient Information Dissemination Despite Noisy, Limited and Anonymous Communication
O. Feinerman
Bernhard Haeupler
Amos Korman
94
48
0
14 Nov 2013
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
Gossip vs. Markov Chains, and Randomness-Efficient Rumor Spreading
Zeyu Guo
He Sun
36
5
0
12 Nov 2013
Tight Bounds for Rumor Spreading with Vertex Expansion
Tight Bounds for Rumor Spreading with Vertex Expansion
George Giakkoupis
58
56
0
25 Feb 2013
Simple, Fast and Deterministic Gossip and Rumor Spreading
Simple, Fast and Deterministic Gossip and Rumor Spreading
Bernhard Haeupler
65
70
0
03 Oct 2012
Simple and Optimal Randomized Fault-Tolerant Rumor Spreading
Simple and Optimal Randomized Fault-Tolerant Rumor Spreading
Benjamin Doerr
Carola Doerr
Shay Moran
S. Moran
61
6
0
27 Sep 2012
Tighter Worst-Case Bounds on Algebraic Gossip
Tighter Worst-Case Bounds on Algebraic Gossip
Bernhard Haeupler
53
8
0
31 May 2012
Order Optimal Information Spreading Using Algebraic Gossip
Order Optimal Information Spreading Using Algebraic Gossip
C. Avin
Michael Borokhovich
K. Censor-Hillel
Zvi Lotker
93
19
0
23 Jan 2011
Analyzing Network Coding Gossip Made Easy
Analyzing Network Coding Gossip Made Easy
Bernhard Haeupler
94
1
0
04 Oct 2010
1