Combining shared-coin algorithms (Q666060): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Time- and Space-Efficient Randomized Consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized consensus in expected O(n log n) individual work / 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: Fast randomized consensus using shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Consensus in Expected $O(N\log ^2 N)$ Operations Per Processor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549610 / 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: Q4003764 / 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: Q3519383 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138972 / rank
 
Normal rank

Latest revision as of 00:02, 5 July 2024

scientific article
Language Label Description Also known as
English
Combining shared-coin algorithms
scientific article

    Statements

    Combining shared-coin algorithms (English)
    0 references
    0 references
    0 references
    0 references
    7 March 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    distributed computing
    0 references
    shared memory
    0 references
    randomized algorithms
    0 references
    consensus
    0 references
    shared coins
    0 references
    0 references