Pages that link to "Item:Q2931807"
From MaRDI portal
The following pages link to Quantitative relaxation of concurrent data structures (Q2931807):
Displayed 14 items.
- The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Decidability and complexity for quiescent consistency and its variations (Q1680503) (← links)
- 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)
- Decomposable Relaxation for Concurrent Data Structures (Q2971134) (← links)
- The Computability of Relaxed Data Structures: Queues and Stacks as Examples (Q3460732) (← links)
- Verifying Visibility-Based Weak Consistency (Q5041095) (← links)
- Strict Linearizability and Abstract Atomicity (Q5859670) (← links)
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)
- Quantifiability: a concurrent correctness condition modeled in vector space (Q6161035) (← links)
- Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability (Q6202229) (← links)
- Brief Announcement: Improved, Partially-Tight Multiplicity Queue Lower Bounds (Q6202279) (← links)