Wait-free approximate agreement on graphs (Q5918635): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Principles of Distributed Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topology of look-compute-move robot wait-free algorithms with hard termination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why extension-based proofs fail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brief Announcement: Why Extension-Based Proofs Fail / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are wait-free algorithms fast? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple algorithmically reasoned characterization of wait-free computation (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The BG distributed simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing by Mobile Robots: Gathering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polytopal generalization of Sperner's lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reaching approximate agreement in the presence of faults / rank
 
Normal rank
Property / cites work
 
Property / cites work: On diameters and radii of bridged graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local convexity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous approximate agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy impossibility proofs for distributed consensus problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossibility of distributed consensus with one faulty process / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Bounds for Asymptotic and Approximate Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Round-by-round fault detectors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5498755 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asynchronous computability theorem for <i>t</i>-resilient tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toward a Topological Characterization of Asynchronous Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidimensional agreement in Byzantine systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed computability in Byzantine asynchronous systems / 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: Wait-Free <i>k</i>-Set Agreement is Impossible: The Topology of Public Knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252757 / rank
 
Normal rank

Latest revision as of 09:34, 28 July 2024

scientific article; zbMATH DE number 7495135
Language Label Description Also known as
English
Wait-free approximate agreement on graphs
scientific article; zbMATH DE number 7495135

    Statements

    Wait-free approximate agreement on graphs (English)
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    approximate agreement
    0 references
    wait-free
    0 references
    extension-based proofs
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references