The following pages link to (Q3546780):
Displayed 11 items.
- The one-out-of-\(k\) retrieval problem and linear network coding (Q259276) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks (Q694835) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- The cost of global broadcast in dynamic radio networks (Q2285142) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- Bounds for algebraic gossip on graphs (Q2925522) (← links)
- The Missing Piece Syndrome in Peer-to-Peer Communication (Q5168845) (← links)
- Order optimal information spreading using algebraic gossip (Q5891123) (← links)