scientific article; zbMATH DE number 7525473
From MaRDI portal
Publication:5075774
DOI10.4230/LIPIcs.ESA.2019.36MaRDI QIDQ5075774
Rami Daknama, Simon Reisser, Konstantinos D. Panagiotou
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cites Work
- Diameter and broadcast time of random geometric graphs in arbitrary dimensions
- On the runtime and robustness of randomized broadcasting
- On the resilience of long cycles in random graphs
- The shortest-path problem for graphs with random arc-lengths
- Rumor spreading with bounded in-degree
- Asynchronous rumor spreading on random graphs
- Simple, Fast and Deterministic Gossip and Rumor Spreading
- Randomized broadcast in networks
- Expander graphs and their applications
- Rumor Spreading on Random Regular Graphs and Expanders
- Local resilience of graphs
- Rumor Spreading and Conductance
- The String of Diamonds Is Tight for Rumor Spreading
- Tight Analysis of Randomized Rumor Spreading in Complete Graphs
- Randomized Rumour Spreading: The Effect of the Network Topology
- Tight Bounds for Rumor Spreading with Vertex Expansion
- Global computation in a poorly connected world
- Social networks spread rumors in sublogarithmic time
- Advanced Lectures on Machine Learning
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication:
