Congested Clique Algorithms for Graph Spanners (Q5090933): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
label / enlabel / en
 
Congested Clique Algorithms for Graph Spanners
Property / author
 
Property / author: Merav Parter / rank
Normal rank
 
Property / author
 
Property / author: Merav Parter / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1805.05404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive-Closure Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balls and Bins: Smaller Hash Families and Faster Evaluation / 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: Fast deterministic distributed algorithms for sparse spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the locality of distributed sparse spanner construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Computation of Nearly Additive Spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear fully distributed partition with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Distributed Algorithm for Maximal Independent Set / 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: Lessons from the congested clique applied to MapReduce / 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 Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Synchronizer for the Hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed algorithms for ultrasparse spanners and linear size skeletons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963005538 / rank
 
Normal rank
Property / title
 
Congested Clique Algorithms for Graph Spanners (English)
Property / title: Congested Clique Algorithms for Graph Spanners (English) / rank
 
Normal rank

Latest revision as of 12:02, 30 July 2024

scientific article; zbMATH DE number 7561292
Language Label Description Also known as
English
Congested Clique Algorithms for Graph Spanners
scientific article; zbMATH DE number 7561292

    Statements

    0 references
    0 references
    21 July 2022
    0 references
    distributed graph algorithms
    0 references
    spanner
    0 references
    congested clique
    0 references
    Congested Clique Algorithms for Graph Spanners (English)
    0 references

    Identifiers

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