The time complexity of updating snapshot memories (Q293175): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Composite registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic snapshots of shared memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic snapshots using lattice agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are wait-free algorithms fast? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Atomic snapshots in <i>O(n</i> log <i>n)</i> operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Lapse Snapshots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal multi-writer multi-reader atomic register / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time complexity of updating snapshot memories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time snapshot implementations in unbalanced systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interprocess communication. I: Basic formalism / rank
 
Normal rank
Property / cites work
 
Property / cites work: On interprocess communication. II: Algorithms / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065344737 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
The time complexity of updating snapshot memories
scientific article

    Statements

    Identifiers