Pages that link to "Item:Q518927"
From MaRDI portal
The following pages link to The computability of relaxed data structures: queues and stacks as examples (Q518927):
Displaying 4 items.
- Lower bounds on message passing implementations of multiplicity-relaxed queues and stacks (Q2097352) (← links)
- Anomalies and similarities among consensus numbers of variously-relaxed queues (Q2218476) (← links)
- Relaxed data types as consistency conditions (Q2283840) (← links)
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)
