Improved deterministic leader election in diameter-two networks (Q6057346): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Message Bounds for Randomized Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of leader election in diameter-two networks / 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: Leader Election in Well-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579423 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient distributed approximation algorithms via probabilistic tree embeddings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable leader election / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimality of Distributive Constructions of Minimum Weight and Degree Restricted Spanning Trees in a Complete Network of Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal lower bounds for some distributed algorithms for a complete network of processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Universal Leader Election / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear bounds for randomized leader election / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching Agreement in the Presence of Faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design and Analysis of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fair Leader Election for Rational Agents in Asynchronous Rings and Networks / rank
 
Normal rank

Latest revision as of 02:45, 3 August 2024

scientific article; zbMATH DE number 7745716
Language Label Description Also known as
English
Improved deterministic leader election in diameter-two networks
scientific article; zbMATH DE number 7745716

    Statements

    Improved deterministic leader election in diameter-two networks (English)
    0 references
    0 references
    4 October 2023
    0 references
    0 references
    distributed algorithm
    0 references
    leader election
    0 references
    message complexity
    0 references
    diameter-two graphs
    0 references