Near-optimal scheduling in the congested clique
From MaRDI portal
Publication:2117708
DOI10.1007/978-3-030-79527-6_4OpenAlexW3175439416MaRDI QIDQ2117708FDOQ2117708
Authors: Keren Censor-Hillel, Yannic Maus, Volodymyr Polosukhin 
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
- Title not available (Why is that?)
- Optimal deterministic routing and sorting on the congested clique
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- On Distributed Listing of Cliques
- Near-optimal scheduling of distributed algorithms
- Distributed computation of large-scale graph problems
- Title not available (Why is that?)
- Toward optimal bounds in the congested clique, graph connectivity and MST
- ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)
- Congested Clique Algorithms for the Minimum Cut Problem
- Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
- Fast Approximate Shortest Paths in the Congested Clique
- MST in \(O(1)\) rounds of congested clique
- Improved massively parallel computation algorithms for MIS, matching, and vertex cover
- Distributed triangle detection via expander decomposition
- MST in log-star rounds of congested clique
- Distributed MIS via all-to-all communication
- Derandomizing local distributed algorithms under bandwidth restrictions
- Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
- Triangle Finding and Listing in CONGEST Networks
- Simple, Deterministic, Constant-Round Coloring in the Congested Clique
This page was built for publication: Near-optimal scheduling in the congested clique
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117708)
