Pages that link to "Item:Q1664155"
From MaRDI portal
The following pages link to Specifying concurrent problems: beyond linearizability and up to tasks (extended abstract) (Q1664155):
Displaying 12 items.
- Geometric and combinatorial views on asynchronous computability (Q1657197) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- Life beyond set agreement (Q2189171) (← links)
- Relaxed data types as consistency conditions (Q2283840) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- t-Resilient Immediate Snapshot Is Impossible (Q2835025) (← links)
- Reflections on the future of concurrency theory in general and process calculi in particular (Q2870196) (← links)
- Foreword (Q4261315) (← links)
- Unifying Concurrent Objects and Distributed Tasks (Q4625665) (← links)
- (Q5091082) (← links)
- (Q5091106) (← links)
- Distributed Computing (Q5897405) (← links)