Pages that link to "Item:Q5361376"

The following pages link to A completeness theorem for a class of synchronization objects (Q5361376):

Displaying 13 items.

• Solving the at-most-once problem with nearly optimal effectiveness (Q391254) (← links)
• Power and limits of distributed computing shared memory models (Q392187) (← links)
• The power of multiobjects. (Q1854306) (← links)
• Common2 extended to stacks and unbounded concurrency (Q1954246) (← links)
• Extending the wait-free hierarchy to multi-threaded systems (Q2166369) (← links)
• On the viability of the deterministic consensus hierarchy (Q2182644) (← links)
• Bounded disagreement (Q2182645) (← links)
• Life beyond set agreement (Q2189171) (← links)
• (Q5090908) (← links)
• On the use of registers in achieving wait-free consensus (Q5137333) (← links)
• Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
• A closer look at fault tolerance (Q5895044) (← links)
• Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity (Q6099028) (← links)