The worst case behavior of randomized gossip protocols
type: Item
instance of: scholarly article
title: The worst case behavior of randomized gossip protocols
zbMATH Open document ID: 1303.68030
author: Hervé Baumann
author: Pierre Fraigniaud
author: Hovhannes A. Harutyunyan
author: Rémi de Joannis de Verclos
published in: Theoretical Computer Science
publication date: 2014-12-02T00:00:00Z
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B18
zbMATH DE Number: 6376179
zbMATH Keywords: rumor spreading
zbMATH Keywords: broadcast
zbMATH Keywords: gossip
zbMATH Keywords: random phone-call model
MaRDI profile type: Publication
full work available at URL: j.tcs.2014.08.008
OpenAlex ID: W2037067117
cites work: Q4542563
cites work: Efficient randomised broadcasting in random regular networks with applications in peer-to-peer systems
cites work: Q3546603
cites work: Partial information spreading with application to distributed maximum coverage
cites work: Q5417739
cites work: Almost tight bounds for rumour spreading with conductance
cites work: Q3579453
cites work: Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
cites work: A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
cites work: Q4471276
cites work: On randomized broadcasting in star graphs
cites work: Broadcasting vs. Mixing and Information Dissemination on Cayley Graphs
cites work: Q3579471
cites work: On the runtime and robustness of randomized broadcasting
cites work: Rumor Spreading on Random Regular Graphs and Expanders
cites work: Methods and problems of communication in usual networks
cites work: The shortest-path problem for graphs with random arc-lengths
cites work: Broadcasting in random graphs
cites work: Q3113672
cites work: Q5365055
cites work: Q4405771
cites work: Messy broadcasting - decentralized broadcast schemes with limited knowledge
cites work: A survey of gossiping and broadcasting in communication networks
cites work: Q4870160
cites work: An optimal greedy heuristic to color interval graphs
cites work: On Spreading a Rumor
cites work: On Mixing and Edge Expansion Properties in Randomized Broadcasting
cites work: Q5365056
DOI: 10.1016/J.TCS.2014.08.008
description: scientific article; zbMATH DE number 6376179