Faster randomized consensus with an oblivious adversary (Q5918243): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sub-logarithmic Test-and-Set against a Weak Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Consensus in Expected O(n 2) Total Work Using Single-Writer Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster randomized consensus with an oblivious adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modular approach to shared-memory consensus, with applications to the probabilistic-write model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining shared-coin algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic concurrent data structures from monotone circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate shared-memory counting despite a strong adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for adopt-commit objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for asynchronous randomized consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized Consensus under a Weak Adversary / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient asynchronous consensus with the weak adversary scheduler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog randomized wait-free consensus / 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: Round-by-round fault detectors (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the time and space complexity of randomized test-and-set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearizable implementations do not suffice for randomized distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement / rank
 
Normal rank

Latest revision as of 21:13, 9 July 2024

scientific article; zbMATH DE number 6419523
Language Label Description Also known as
English
Faster randomized consensus with an oblivious adversary
scientific article; zbMATH DE number 6419523

    Statements

    Faster randomized consensus with an oblivious adversary (English)
    0 references
    0 references
    25 March 2015
    0 references
    consensus
    0 references
    conciliators
    0 references
    randomization
    0 references
    oblivious adversary
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references