Pages that link to "Item:Q5368954"
From MaRDI portal
The following pages link to Distributed MIS via All-to-All Communication (Q5368954):
Displaying 10 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- (Delta+1) Coloring in the Congested Clique Model (Q5002850) (← links)
- Randomized (Delta+1)-Coloring in O(log* Delta) Congested Clique Rounds (Q5090932) (← links)
- (Q5091075) (← links)
- (Q5092346) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q6487482) (← links)
- Improved MPC algorithms for MIS, matching, and coloring on trees and beyond (Q6535033) (← links)