Pages that link to "Item:Q4625665"
From MaRDI portal
The following pages link to Unifying Concurrent Objects and Distributed Tasks (Q4625665):
Displaying 11 items.
- Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) (Q1664155) (← links)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (Q2672251) (← links)
- Agreeing within a few writes (Q2672593) (← links)
- (Q4251120) (← links)
- Local linearizability for concurrent container-type data structures (Q4608657) (← links)
- A Sound Foundation for the Topological Approach to Task Solvability (Q5875396) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)
- Intermediate value linearizability: a quantitative correctness criterion (Q6534999) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6536328) (← links)