The correctness proof of Ben-Or's randomized consensus algorithm (Q1938380): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1967908173 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549610 / 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: Fast randomized consensus using shared memory / 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: The correctness proof of Ben-Or's randomized consensus algorithm / 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: Linearizable implementations do not suffice for randomized distributed computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126969 / rank
 
Normal rank

Revision as of 03:49, 6 July 2024

scientific article
Language Label Description Also known as
English
The correctness proof of Ben-Or's randomized consensus algorithm
scientific article

    Statements

    Identifiers