Pages that link to "Item:Q465682"
From MaRDI portal
The following pages link to The renaming problem in shared memory systems: an introduction (Q465682):
Displaying 17 items.
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- A simplicial complex model for dynamic epistemic logic to study distributed task computability (Q2029604) (← links)
- A visit to mutual exclusion in seven dates (Q2136281) (← links)
- Waiting in concurrent algorithms (Q2218425) (← links)
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects (Q2802146) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- (Q3305190) (← links)
- Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
- What Can be Computed in a Distributed System? (Q5170751) (← links)
- A closer look at fault tolerance (Q5895044) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6044466) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+} (Q6536175) (← links)
- Tasks in modular proofs of concurrent algorithms (Q6536328) (← links)
- Simplicial models for the epistemic logic of faulty agents (Q6624996) (← links)
