Near-optimal scheduling in the congested clique
From MaRDI portal
Publication:2117708
Cites work
- scientific article; zbMATH DE number 3576688 (Why is no real title available?)
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- Congested Clique Algorithms for the Minimum Cut Problem
- Derandomizing local distributed algorithms under bandwidth restrictions
- Distributed MIS via all-to-all communication
- Distributed computation of large-scale graph problems
- Distributed triangle detection via expander decomposition
- Fast Approximate Shortest Paths in the Congested Clique
- Faster Algorithms for Edge Connectivity via Random 2-Out Contractions
- Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems
- Improved massively parallel computation algorithms for MIS, matching, and vertex cover
- MST in \(O(1)\) rounds of congested clique
- MST in log-star rounds of congested clique
- Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
- Near-optimal scheduling of distributed algorithms
- On Distributed Listing of Cliques
- Optimal deterministic routing and sorting on the congested clique
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Simple, Deterministic, Constant-Round Coloring in the Congested Clique
- Toward optimal bounds in the congested clique, graph connectivity and MST
- Triangle Finding and Listing in CONGEST Networks
- ``Tri, tri again: finding triangles and small subgraphs in a distributed setting (extended abstract)
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)
