Pages that link to "Item:Q2942766"
From MaRDI portal
The following pages link to Resource discovery in distributed networks (Q2942766):
Displayed 15 items.
- Robust gossiping with an application to consensus (Q856404) (← links)
- A note on models for graph representations (Q1008739) (← links)
- Probabilistic quorums for dynamic systems (Q1953642) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- A note on the parallel runtime of self-stabilizing graph linearization (Q2254491) (← links)
- Faster rumor spreading with multiple calls (Q2256120) (← links)
- A deterministic worst-case message complexity optimal solution for resource discovery (Q2345458) (← links)
- Dynamic gossip (Q2415893) (← links)
- Efficient communication in unknown networks (Q2747804) (← links)
- Discovery Through Gossip (Q2811164) (← links)
- Randomized rumor spreading in poorly connected small-world networks (Q2818280) (← links)
- A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery (Q2868642) (← links)
- Probabilistic Analysis of Rumor-Spreading Time (Q5139858) (← links)
- On the Push&Pull Protocol for Rumor Spreading (Q5346546) (← links)
- (Q5743505) (← links)