Near-optimal scheduling in the congested clique (Q2117708): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast Approximate Shortest Paths in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Distributed Listing of Cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing local distributed algorithms under bandwidth restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Triangle Detection via Expander Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple, Deterministic, Constant-Round Coloring in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Scheduling of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MIS via All-to-All Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Congested Clique Algorithms for the Minimum Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Edge Connectivity via Random 2-Out Contractions / rank
 
Normal rank
Property / cites work
 
Property / cites work: MST in Log-Star Rounds of Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward Optimal Bounds in the Congested Clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Finding and Listing in CONGEST Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computation of Large-scale Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal deterministic routing and sorting on the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum-Weight Spanning Tree Construction in <i>O</i>(log log <i>n</i>) Communication Rounds / rank
 
Normal rank

Latest revision as of 10:34, 28 July 2024

scientific article
Language Label Description Also known as
English
Near-optimal scheduling in the congested clique
scientific article

    Statements

    Near-optimal scheduling in the congested clique (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed algorithms
    0 references
    congested clique
    0 references
    scheduling
    0 references
    maximal independent set
    0 references
    0 references
    0 references
    0 references
    0 references