Pages that link to "Item:Q487260"
From MaRDI portal
The following pages link to Tight bounds for adopt-commit objects (Q487260):
Displayed 9 items.
- On the complexity of basic abstractions to implement consensus (Q683759) (← links)
- On the uncontended complexity of anonymous agreement (Q1682223) (← links)
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Agreeing within a few writes (Q2672593) (← links)
- Concurrent Use of Write-Once Memory (Q2835021) (← links)
- Allocate-On-Use Space Complexity of Shared-Memory Algorithms (Q5090897) (← links)
- Faster randomized consensus with an oblivious adversary (Q5918243) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)