Pages that link to "Item:Q2189176"
From MaRDI portal
The following pages link to Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176):
Displaying 7 items.
- Near-optimal scheduling in the congested clique (Q2117708) (← links)
- Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set (Q5090921) (← links)
- Congested Clique Algorithms for Graph Spanners (Q5090933) (← links)
- Network Decomposition and Distributed Derandomization (Invited Paper) (Q5100942) (← links)
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC (Q5860478) (← links)
- Superfast coloring in CONGEST via efficient color sampling (Q5925614) (← links)
- Deterministic Massively Parallel Connectivity (Q6069413) (← links)
