New lower bound techniques for distributed leader finding and other problems on rings of processors (Q808701): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q59568030 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006888470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Bit Complexity of Randomized Leader Election on a Ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized function evaluation on a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on an anonymous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3769937 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better lower bound for distributed leader finding in bidirectional asynchronous rings of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3742712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3974855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / 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: Electing a leader in a synchronous ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3319762 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average number of messages for distributed leader-fitting in rings of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for probabilistic distributed algorithms / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:36, 24 June 2024

scientific article
Language Label Description Also known as
English
New lower bound techniques for distributed leader finding and other problems on rings of processors
scientific article

    Statements

    New lower bound techniques for distributed leader finding and other problems on rings of processors (English)
    0 references
    0 references
    1991
    0 references
    leader election
    0 references
    asynchronous ring of processors
    0 references
    distributed algorithm
    0 references
    lower bound
    0 references
    randomized algorithms
    0 references

    Identifiers