Pages that link to "Item:Q2933777"
From MaRDI portal
The following pages link to The communication complexity of distributed task allocation (Q2933777):
Displayed 10 items.
- Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
- Doing-it-all with bounded work and communication (Q529041) (← links)
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- The role of randomness in the broadcast congested clique model (Q2051760) (← links)
- Connectivity and connected components in the number-in-hand computation model (Q2086717) (← links)
- Solving the Induced Subgraph Problem in the Randomized Multiparty Simultaneous Messages Model (Q3460729) (← links)
- (Q5091075) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- Bounds on oblivious multiparty quantum communication complexity (Q6164004) (← links)