The following pages link to The mutual exclusion problem (Q5903450):
Displaying 45 items.
- A distributed resource allocation algorithm for many processes (Q378202) (← links)
- On the family of critical section problems (Q458377) (← links)
- The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
- On starvation and some related issues (Q751268) (← links)
- A technique for decomposing algorithms which use a single shared variable (Q800081) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Space efficient processor identity protocol (Q910199) (← links)
- Automated analysis of mutual exclusion algorithms using CCS (Q911263) (← links)
- The processor identity problem (Q917266) (← links)
- Space-efficient FCFS group mutual exclusion (Q1041781) (← links)
- Distributed mutual exclusion on a ring of processes (Q1060005) (← links)
- Comments on Morris's starvation-free solution to the mutual exclusion problem (Q1081301) (← links)
- The butterfly barrier (Q1100876) (← links)
- An optimal distributed solution to the dining philosphers problem (Q1100887) (← links)
- \(k\)-Arbiter: A safe and general scheme for \(h\)-out of-\(k\) mutual exclusion (Q1127529) (← links)
- Mutual exclusion versus coexistence for discrete competitive systems (Q1180356) (← links)
- Tuning distributed control algorithms for optimal functioning (Q1187845) (← links)
- Optimality of wait-free atomic multiwriter variables (Q1199944) (← links)
- A note of Raymond's tree based algorithm for distributed mutual exclusion (Q1199950) (← links)
- Bounded time-stamps (Q1261108) (← links)
- Self-stabilizing extensions for message-passing systems (Q1310564) (← links)
- Self-stabilization over unreliable communication media (Q1310565) (← links)
- Stabilization and pseudo-stabilization (Q1310567) (← links)
- Self-stabilizing depth-first search (Q1321819) (← links)
- A fine-grained solution to the mutual exclusion problem (Q1323338) (← links)
- On the mutual-exclusion problem -- a quest for minimal solutions (Q1329738) (← links)
- A self-stabilizing algorithm for strong fairness (Q1387705) (← links)
- On the computational power of self-stabilizing systems (Q1391125) (← links)
- Efficiency of asynchronous systems, read arcs, and the MUTEX-problem (Q1607225) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Group mutual exclusion in linear time and space (Q1686110) (← links)
- Bounded self-stabilizing Petri nets (Q1892714) (← links)
- Nonatomic mutual exclusion with local spinning (Q1954193) (← links)
- Recoverable mutual exclusion (Q2010612) (← links)
- Tight space bounds for \(\ell\)-exclusion (Q2251155) (← links)
- Tight Space Bounds for ℓ-Exclusion (Q3095320) (← links)
- SELF-STABILIZING PROTOCOL FOR MUTUAL EXCLUSION AMONG NEIGHBORING NODES IN A TREE STRUCTURED DISTRIBUTED SYSTEM (Q3146520) (← links)
- On optimal management of resources in distributed networks (Q3204038) (← links)
- Une approche quantitative de l'exclusion mutuelle (Q3738552) (← links)
- The mutual exclusion problem: part II---Statement and solutions (Q5133678) (← links)
- On the power of shared object types to implement one-resilient Consensus (Q5137906) (← links)
- Shared-memory mutual exclusion: major research trends since 1986 (Q5138486) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Safety assurance via on-line monitoring (Q5138497) (← links)
- Self-stabilizing \(\ell\)-exclusion (Q5958773) (← links)
