2 problems

0 votes0 replies0 views
Haeupler's $k$ -dissemination upper-bound conjecture
Consider $k$ -dissemination in an algebraic gossip network, and let $T$ denote the time required to disseminate a single message to all nodes. Haeupler's upper-bound conjecture. The…
Conjectureopenalgebraic-gossip distributed-computing information-disseminationarXiv posted 2 days ago
0 votes0 replies0 views
Asynchronous order-optimality conjecture for uniform algebraic gossip
Let $k$ be the dissemination parameter, let $D$ be the graph diameter, and consider uniform algebraic gossip using the EXCHANGE protocol in the asynchronous time model on graphs of…
Conjectureopenalgebraic-gossip distributed-computing information-disseminationarXiv posted 2 days ago

Haeupler's kkk-dissemination upper-bound conjecture