Pages that link to "Item:Q2910849"
From MaRDI portal
The following pages link to Almost-optimal gossip-based aggregate computation (Q2910849):
Displaying 9 items.
- Lower bounds for in-network computation of arbitrary functions (Q1981801) (← links)
- Discovery through gossip (Q2811164) (← links)
- Aggregation in dynamic networks (Q2933795) (← links)
- Optimal gossip with direct addressing (Q2943620) (← links)
- A Generalized Gossip Algorithm on Convex Metric Spaces (Q2982730) (← links)
- The Cost of Fault Tolerance in Multi-Party Communication Complexity (Q3189654) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q5964896) (← links)
- Near-optimal communication-time tradeoff in fault-tolerant computation of aggregate functions (Q6483583) (← links)
- Distributed data summarization in well-connected networks (Q6487549) (← links)