The following pages link to (Q5363797):
Displaying 11 items.
- Lessons from the congested clique applied to MapReduce (Q896148) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Distributed distance computation and routing with small messages (Q2422769) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Distributed Exact Weighted All-Pairs Shortest Paths in Randomized Near-Linear Time (Q5020729) (← links)
- (Q5091075) (← links)
- The Impact of Locality in the Broadcast Congested Clique Model (Q5220411) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)
- Distributed construction of purely additive spanners (Q5915631) (← links)
