Near-optimal scheduling in the congested clique
From MaRDI portal
Publication:2117708
DOI10.1007/978-3-030-79527-6_4OpenAlexW3175439416MaRDI QIDQ2117708
Volodymyr Polosukhin, Keren Censor-Hillel, Yannic Maus
Publication date: 22 March 2022
Full work available at URL: https://arxiv.org/abs/2102.07221
Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
- Algebraic methods in the congested clique
- Derandomizing local distributed algorithms under bandwidth restrictions
- Near-Optimal Scheduling of Distributed Algorithms
- Toward Optimal Bounds in the Congested Clique
- “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting
- Fast Approximate Shortest Paths in the Congested Clique
- Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
- Optimal deterministic routing and sorting on the congested clique
- Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
- Congested Clique Algorithms for the Minimum Cut Problem
- Distributed Triangle Detection via Expander Decomposition
- MST in Log-Star Rounds of Congested Clique
- Distributed Computation of Large-scale Graph Problems
- Distributed MIS via All-to-All Communication
- Triangle Finding and Listing in CONGEST Networks
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- On Distributed Listing of Cliques
- Simple, Deterministic, Constant-Round Coloring in the Congested Clique
This page was built for publication: Near-optimal scheduling in the congested clique
