Pages that link to "Item:Q2943403"
From MaRDI portal
The following pages link to The round complexity of distributed sorting (Q2943403):
Displaying 8 items.
- Tight bounds for parallel randomized load balancing (Q287991) (← links)
- Sub-logarithmic distributed algorithms for metric facility location (Q748120) (← links)
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique Model (Q2817860) (← links)
- (Q5091075) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
