Efficient elections in chordal ring networks (Q1262125): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: Electing a leader in a synchronous ring / 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: 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: Q3332237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Combinatorial Problem Related to Multimodule Memory Organizations / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:30, 20 June 2024

scientific article
Language Label Description Also known as
English
Efficient elections in chordal ring networks
scientific article

    Statements

    Efficient elections in chordal ring networks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1989
    0 references
    0 references
    0 references
    0 references
    0 references
    chordal ring
    0 references
    distributed network
    0 references
    distributed algorithm
    0 references
    leader
    0 references
    election
    0 references
    communication complexity
    0 references