Pages that link to "Item:Q4388875"
From MaRDI portal
The following pages link to Atomic Snapshots in <i>O</i> (<i>n</i> log <i>n</i>) Operations (Q4388875):
Displayed 18 items.
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method (Q455960) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Help when needed, but no more: efficient read/write partial snapshot (Q663424) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- Lower and upper bounds for single-scanner snapshot implementations (Q2401677) (← links)
- Of choices, failures and asynchrony: the many faces of set agreement (Q2428676) (← links)
- The F-Snapshot Problem (Q2835024) (← links)
- (Q3305190) (← links)
- Linear-time snapshot implementations in unbalanced systems (Q4850334) (← links)
- (Q5090934) (← links)
- An adaptive collect algorithm with applications (Q5138374) (← links)
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
- Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (Q5501949) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)