Simple and efficient network decomposition and synchronization (Q1575640): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Shlomo Moran / rank
Normal rank
 
Property / author
 
Property / author: Sagi Snir / rank
Normal rank
 
Property / author
 
Property / author: Shlomo Moran / rank
 
Normal rank
Property / author
 
Property / author: Sagi Snir / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparser: A Paradigm for Running Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of network synchronization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing with Polynomial Communication-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online tracking of mobile users / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3883524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal distributed algorithm for minimum spanning trees revisited / 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: Low diameter graph decompositions / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0304-3975(98)00206-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2126251084 / rank
 
Normal rank

Latest revision as of 11:57, 30 July 2024

scientific article
Language Label Description Also known as
English
Simple and efficient network decomposition and synchronization
scientific article

    Statements

    Simple and efficient network decomposition and synchronization (English)
    0 references
    21 August 2000
    0 references
    0 references
    graph decompositions
    0 references
    asynchronous communication networks
    0 references
    synchronizers
    0 references
    0 references
    0 references
    0 references