Pages that link to "Item:Q2910851"
From MaRDI portal
The following pages link to On the inherent sequentiality of concurrent objects (Q2910851):
Displaying 10 items.
- The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
- Solo-valency and the cost of coordination (Q2377250) (← links)
- Lower bounds for restricted-use objects (Q2812146) (← links)
- Lower bounds on the amortized time complexity of shared objects (Q3300815) (← links)
- Asynchronous and deterministic objects (Q3452255) (← links)
- The Computability of Relaxed Data Structures: Queues and Stacks as Examples (Q3460732) (← links)
- Of Concurrent Data Structures and Iterations (Q3464481) (← links)
- (Q4522244) (← links)
- Unifying Concurrent Objects and Distributed Tasks (Q4625665) (← links)
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)