The following pages link to (Q5090932):
Displayed 5 items.
- Fast approximate shortest paths in the congested clique (Q2064057) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- (Q5075750) (← links)
- Distributed $(\Delta+1)$-Coloring via Ultrafast Graph Shattering (Q5112251) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)