Lessons from the congested clique applied to MapReduce (Q896148): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Super-Fast Distributed Algorithms for Metric Facility Location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993417 / 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: The communication complexity of distributed task allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of the congested clique model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Plant and Warehouse Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for the Facility Location Problem / 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: Q5363797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple distributed \(\Delta+1\)-coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Super-Fast 3-Ruling Sets. / 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
Property / cites work
 
Property / cites work: Distributed MST for constant diameter graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility location / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed approximation algorithms for weighted shortest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Return of the primal-dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rapid randomized pruning for fast greedy distributed algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The round complexity of distributed sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking depending on the chromatic number or the neighborhood growth / rank
 
Normal rank

Latest revision as of 05:33, 11 July 2024

scientific article
Language Label Description Also known as
English
Lessons from the congested clique applied to MapReduce
scientific article

    Statements

    Lessons from the congested clique applied to MapReduce (English)
    0 references
    0 references
    0 references
    11 December 2015
    0 references
    congested clique
    0 references
    distributed algorithms
    0 references
    graph coloring
    0 references
    MapReduce
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references