scientific article
From MaRDI portal
DOI10.4230/LIPIcs.STACS.2011.57zbMath1230.68053MaRDI QIDQ3113672
Publication date: 23 January 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_f010.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Randomized algorithms (68W20)
Related Items
Stochastic analysis of rumor spreading with multiple pull operations, Asynchronous rumor spreading on random graphs, On the Push&Pull Protocol for Rumor Spreading, Push is Fast on Sparse Random Graphs, Continuous-time stochastic analysis of rumor spreading with multiple operations, Asymptotic optimality for decentralised bandits, Rumor Spreading with No Dependence on Conductance, Randomized Rumour Spreading: The Effect of the Network Topology, Leader election in well-connected graphs, Probabilistic Analysis of Rumor-Spreading Time, The worst case behavior of randomized gossip protocols, Faster rumor spreading with multiple calls, Unnamed Item, Unnamed Item, Asymptotics for push on the complete graph, Rumor spreading with bounded in-degree, On the spread of influence in graphs, Simple multi-party set reconciliation, Breaking the \(\log n\) barrier on rumor spreading, Robustness of randomized rumour spreading, Unnamed Item, Unnamed Item, Communication complexity of quasirandom rumor spreading
