Pages that link to "Item:Q896148"
From MaRDI portal
The following pages link to Lessons from the congested clique applied to MapReduce (Q896148):
Displayed 9 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Equivalence classes and conditional hardness in massively parallel computations (Q2121067) (← links)
- Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
- (Q5091075) (← links)
- (Q5092346) (← links)
- Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE (Q5859656) (← links)