On set consensus numbers (Q661057): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-011-0142-8 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049110438 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-011-0142-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2049110438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The topological structure of asynchronous computability / 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: Generalized FLP impossibility result for <i>t</i>-resilient asynchronous computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unreliable failure detectors for reliable distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every problem has a weakest failure detector / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anti-\(\Omega \): the weakest failure detector for set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time, clocks, and the ordering of events in a distributed system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized wait-free concurrent objects (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Classification of Eventual Failure Detectors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Failure detectors as type boosters / 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: Wait-free <i>k</i>-set agreement is impossible / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weakest failure detector for solving k-set agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Disagreement Power of an Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: The disagreement power of an adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Set Consensus Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight failure detection bounds on atomic object implementations / rank
 
Normal rank

Latest revision as of 20:57, 4 July 2024

scientific article
Language Label Description Also known as
English
On set consensus numbers
scientific article

    Statements

    On set consensus numbers (English)
    0 references
    0 references
    0 references
    6 February 2012
    0 references
    distributed tasks
    0 references
    failure detector
    0 references
    crash failures
    0 references
    shared memory
    0 references

    Identifiers