Symmetry breaking in distributed networks (Q918187): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes / 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: Q3738540 / 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: Concurrent Processes and Their Syntax / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the bit complexity of distributed computations in a ring with a leader / 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: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: The choice coordination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3725535 / rank
 
Normal rank

Latest revision as of 10:13, 21 June 2024

scientific article
Language Label Description Also known as
English
Symmetry breaking in distributed networks
scientific article

    Statements

    Symmetry breaking in distributed networks (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    electing a leader
    0 references
    finding the size of the ring
    0 references
    distributed networks
    0 references
    0 references