Tight bounds for shared memory systems accessed by Byzantine processes (Q1953641): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s00446-005-0125-8 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: JSR-166 / 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-005-0125-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006972261 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59701086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing with faulty shared objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-free Byzantine consensus. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contention in shared memory algorithms / 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: Q4860774 / 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: Fault-tolerant wait-free shared objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimistic Approach to Lock-Free FIFO Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2766890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple proof of a simple consensus algorithm / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dc/AlonMRTW05 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00446-005-0125-8 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:22, 16 December 2024

scientific article
Language Label Description Also known as
English
Tight bounds for shared memory systems accessed by Byzantine processes
scientific article

    Statements

    Tight bounds for shared memory systems accessed by Byzantine processes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 June 2013
    0 references
    keywords shared memory
    0 references
    Byzantine agreement
    0 references
    distributed consensus
    0 references
    sticky bits
    0 references

    Identifiers