Communication-efficient randomized consensus (Q2075627): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-017-0315-1 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00446-017-0315-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W9664036 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59522910 / 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: Lower bounds for distributed coin-flipping and randomized consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized protocols for asynchronous 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: 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: 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: Sharing memory robustly in message-passing systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for asynchronous randomized consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog randomized wait-free consensus / 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: Robust gossiping with an application to consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time and Communication Efficient Consensus for Crash Failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast scalable deterministic consensus for crash failures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the space complexity of randomized synchronization / 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: Q3911791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Byzantine Generals Problem / 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: Q3138972 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dc/AlistarhAKS18 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-017-0315-1 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:40, 16 December 2024

scientific article
Language Label Description Also known as
English
Communication-efficient randomized consensus
scientific article

    Statements

    Communication-efficient randomized consensus (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 February 2022
    0 references

    Identifiers