Pages that link to "Item:Q5177272"
From MaRDI portal
The following pages link to Computing separable functions via gossip (Q5177272):
Displayed 20 items.
- In-network estimation of frequency moments (Q531120) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- Leader nodes in communities for information spreading (Q832130) (← links)
- On fast and robust information spreading in the vertex-congest model (Q1625611) (← links)
- Pathogen spread on coupled networks: effect of host and network properties on transmission thresholds (Q1715165) (← links)
- Peer counting and sampling in overlay networks based on random walks (Q1954250) (← links)
- Lower bounds for in-network computation of arbitrary functions (Q1981801) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- LiMoSense: live monitoring in dynamic sensor networks (Q2256962) (← links)
- The firing squad problem revisited (Q2326403) (← links)
- Towards worst-case churn resistant peer-to-peer systems (Q2377141) (← links)
- Discovery Through Gossip (Q2811164) (← links)
- Rumor Spreading with No Dependence on Conductance (Q2963582) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Braid Chain Radio Communication (Q5056066) (← links)
- A stochastic process on a network with connections to Laplacian systems of equations (Q5066880) (← links)
- Partially Ordered Knowledge Sharing and Fractionated Systems in the Context of other Models for Distributed Computing (Q5403079) (← links)
- Order optimal information spreading using algebraic gossip (Q5891123) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
- Distributed Averaging in Opinion Dynamics (Q6202249) (← links)