The following pages link to (Q4234103):
Displaying 9 items.
- Towards a universal construction for transaction-based multiprocess programs (Q391265) (← links)
- Highly-efficient wait-free synchronization (Q487262) (← links)
- Fully-adaptive algorithms for long-lived renaming (Q661054) (← links)
- On the cost of uniform protocols whose memory consumption is adaptive to interval contention (Q1004317) (← links)
- The RedBlue family of universal constructions (Q2220397) (← links)
- An adaptive collect algorithm with applications (Q5138374) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Universal constructions that ensure disjoint-access parallelism and wait-freedom (Q5890930) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)
