Sparsifying Congested Cliques and Core-Periphery Networks (Q2835033): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-48314-6_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2548025525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing on Core-Periphery Networks: Axiom-Based Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence and Construction of Edge-Disjoint Paths on Expander Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: On fast and robust information spreading in the vertex-congest model / 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: Q5501279 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized broadcast in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247194 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees / 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: Lessons from the congested clique applied to MapReduce / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications / 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: Probability and Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Filling Logarithmic Gaps in Distributed Complexity for Global Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Tight Lower Bound on the Time Complexity of Distributed Minimum-Weight Spanning Tree Construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed verification and hardness of distributed approximation / rank
 
Normal rank

Latest revision as of 00:30, 13 July 2024

scientific article
Language Label Description Also known as
English
Sparsifying Congested Cliques and Core-Periphery Networks
scientific article

    Statements

    Sparsifying Congested Cliques and Core-Periphery Networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1 December 2016
    0 references

    Identifiers

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