Pages that link to "Item:Q3604693"
From MaRDI portal
The following pages link to Fast Distributed Algorithms for Computing Separable Functions (Q3604693):
Displaying 18 items.
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Asynchronous privacy-preserving iterative computation on peer-to-peer networks (Q455943) (← links)
- Probabilistic consensus via polling and majority rules (Q475128) (← links)
- Rumor spreading in social networks (Q541666) (← links)
- Multi-client functional encryption for separable functions (Q2061944) (← links)
- Polynomial anonymous dynamic distributed computing without a unique leader (Q2237890) (← links)
- Faster rumor spreading with multiple calls (Q2256120) (← links)
- Rumor spreading with bounded in-degree (Q2292916) (← links)
- Distributed computation in dynamic networks via random walks (Q2345448) (← links)
- Distributed agreement in dynamic peer-to-peer networks (Q2353391) (← links)
- The Complexity of Data Aggregation in Directed Networks (Q3095346) (← links)
- Polynomial Counting in Anonymous Dynamic Networks with Applications to Anonymous Dynamic Algebraic Computations (Q5002846) (← links)
- Polynomial anonymous dynamic distributed computing without a unique leader (Q5092352) (← links)
- Randomized Rumour Spreading: The Effect of the Network Topology (Q5364236) (← links)
- (Q5743420) (← links)
- (Q5743505) (← links)
- (Q5743506) (← links)
- Asymptotics for push on the complete graph (Q5918276) (← links)