Pages that link to "Item:Q3588298"
From MaRDI portal
The following pages link to Fast Randomized Test-and-Set and Renaming (Q3588298):
Displaying 10 items.
- Optimal parallel randomized renaming (Q290183) (← links)
- Efficient randomized test-and-set implementations (Q2010613) (← links)
- Randomized consensus with regular registers (Q2059870) (← links)
- Game-theoretic fairness meets multi-party protocols: the case of leader election (Q2128554) (← links)
- Optimal-time adaptive strong renaming, with applications to counting (Q2943401) (← links)
- Sub-logarithmic Test-and-Set against a Weak Adversary (Q3095319) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms (Q3300814) (← links)
- Allocate-On-Use Space Complexity of Shared-Memory Algorithms (Q5090897) (← links)
- (Q5090913) (← links)