The following pages link to Composite registers (Q2365566):
Displayed 16 items.
- The time complexity of updating snapshot memories (Q293175) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Geometric and combinatorial views on asynchronous computability (Q1657197) (← links)
- The power of multiobjects. (Q1854306) (← links)
- Efficient algorithms for checking the atomicity of a run of read and write operations (Q1892712) (← links)
- Anonymous and fault-tolerant shared-memory computing (Q1954238) (← links)
- Lower and upper bounds for single-scanner snapshot implementations (Q2401677) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- The F-Snapshot Problem (Q2835024) (← links)
- Introduction à l'algorithmique des objets partagés (Q4349778) (← links)
- Linear-time snapshot implementations in unbalanced systems (Q4850334) (← links)
- Atomic snapshots using lattice agreement (Q5136986) (← links)
- Using local-spin k -exclusion algorithms to improve wait-free object implementations (Q5137344) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (Q5501949) (← links)
- Efficient Bounded Timestamping from Standard Synchronization Primitives (Q6202232) (← links)