Anonymous and fault-tolerant shared-memory computing (Q1954238): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067397086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic snapshots of shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Composite registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation in networks of passively mobile finite-state sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between broadcast and shared memory in reliable anonymous distributed systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wait-free consensus with infinite arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing in totally anonymous asynchronous shared memory systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the importance of having an identity or, is consensus really universal? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylog randomized wait-free consensus / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Space Complexity of Unbounded Timestamps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for implementations of snapshots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Computing / 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: The topological structure of asynchronous computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Las-Vegas Processor Identity Problem (How and When to Be Unique) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The processor identity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient processor identity protocol / rank
 
Normal rank

Latest revision as of 13:59, 6 July 2024

scientific article
Language Label Description Also known as
English
Anonymous and fault-tolerant shared-memory computing
scientific article

    Statements

    Anonymous and fault-tolerant shared-memory computing (English)
    0 references
    0 references
    0 references
    20 June 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    anonymous
    0 references
    shared memory
    0 references
    timestamps
    0 references
    snapshots
    0 references
    consensus
    0 references
    0 references