On the message complexity of distributed problems (Q3345763): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 2 users not shown)
Property / author
 
Property / author: Nicola Santoro / rank
Normal rank
 
Property / author
 
Property / author: Nicola Santoro / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Traversal Techniques and the Maximum Flow Problem in Distributed Computation / 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: Distributed algorithms for finding centers and medians in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Distributed Graph Algorithm: Knot Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3945584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved algorithm for decentralized extrema-finding in circular configurations of processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n log n) unidirectional distributed algorithm for extrema finding in a circle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decentralized extrema-finding in circular configurations of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745251 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) Unidirectional Algorithm for the Circular Extrema Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3319762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling Tasks on Unrelated Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Information Transfer in Distributed Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Distributed Maximum-Finding Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On describing the behavior and implementation of distributed systems / rank
 
Normal rank

Latest revision as of 16:11, 14 June 2024

scientific article
Language Label Description Also known as
English
On the message complexity of distributed problems
scientific article

    Statements

    On the message complexity of distributed problems (English)
    0 references
    0 references
    1984
    0 references
    0 references
    distributed algorithms
    0 references
    asynchronous message-passing systems
    0 references
    local topological information
    0 references
    distributed computing
    0 references
    extrema-finding
    0 references
    minimum- weight spanning-tree construction
    0 references
    0 references