The following pages link to Wojciech Golab (Q660998):
Displaying 21 items.
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion (Q660999) (← links)
- Analyzing linearizability violations in the presence of read-modify-write operations (Q1653043) (← links)
- RMR-efficient implementations of comparison primitives using read and write operations (Q1938362) (← links)
- Recoverable mutual exclusion (Q2010612) (← links)
- Computing Weak Consistency in Polynomial Time (Q2796276) (← links)
- A complexity separation between the cache-coherent and distributed shared memory models (Q2943389) (← links)
- Analyzing consistency properties for fun and profit (Q2943399) (← links)
- Making objects writable (Q2943638) (← links)
- Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion (Q3540223) (← links)
- Computing $k$-Atomicity in Polynomial Time (Q4637504) (← links)
- The Recoverable Consensus Hierarchy (Q5145207) (← links)
- An <i>O</i> (1) RMRs leader election algorithm (Q5177285) (← links)
- Recoverable Mutual Exclusion Under System-Wide Failures (Q5197662) (← links)
- Recoverable Mutual Exclusion (Q5361918) (← links)
- Robust Shared Objects for Non-Volatile Main Memory (Q5363811) (← links)
- Recoverable Mutual Exclusion in Sub-logarithmic Time (Q5368966) (← links)
- Brief Announcement (Q5368974) (← links)
- An $O(1)$ RMRs Leader Election Algorithm (Q5390576) (← links)
- Constant-RMR implementations of CAS and other synchronization primitives using read and write operations (Q5401387) (← links)
- Linearizable implementations do not suffice for randomized distributed computation (Q5419107) (← links)
- (Q6083395) (← links)
