Pages that link to "Item:Q4766565"
From MaRDI portal
The following pages link to A new solution of Dijkstra's concurrent programming problem (Q4766565):
Displaying 39 items.
- Concurrent abstract state machines (Q303691) (← links)
- The space complexity of unbounded timestamps (Q352241) (← links)
- A distributed resource allocation algorithm for many processes (Q378202) (← links)
- Implementing sequentially consistent programs on processor consistent platforms (Q436746) (← links)
- Starvation-free mutual exclusion with semaphores (Q469360) (← links)
- Queue based mutual exclusion with linearly bounded overtaking (Q532419) (← links)
- Logical classification of distributed algorithms (Bakery algorithms as an example) (Q541220) (← links)
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion (Q660999) (← links)
- The mailbox problem (Q661002) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- Note on an extremal problem arising for unreliable networks in parallel computing (Q786823) (← links)
- Causality-based game solving (Q832242) (← links)
- Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms (Q897371) (← links)
- A more efficient generalization of Peterson's mutual exclusion algorithm (Q918655) (← links)
- Equational abstractions (Q944377) (← links)
- A queue based mutual exclusion algorithm (Q1006897) (← links)
- Approximated parameterized verification of infinite-state processes with global conditions (Q1039841) (← links)
- Stabilizing mobile philosophers (Q1041771) (← links)
- Solvability of the asynchronous ranking problem (Q1115578) (← links)
- The complexity of problems in systems of communicating sequential processes (Q1146980) (← links)
- The synchronization of independent processes (Q1228197) (← links)
- Bounded time-stamps (Q1261108) (← links)
- Symmetric and economical solutions to the mutual exclusion problem in a distributed system (Q1348531) (← links)
- Proof assistance for real-time systems using an interactive theorem prover (Q1603708) (← links)
- Mutual exclusion as a matter of priority (Q1625608) (← links)
- Highly-fair bakery algorithm using symmetric tokens (Q1675821) (← links)
- Tournaments for mutual exclusion: verification and concurrent complexity (Q1682286) (← links)
- Group mutual exclusion in linear time and space (Q1686110) (← links)
- A new generalization of Dekker's algorithm for mutual exclusion (Q1819931) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- Self-stabilizing timestamps (Q1884893) (← links)
- On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (Q1931906) (← links)
- Linearizable counting networks (Q5137016) (← links)
- Adaptive and efficient mutual exclusion (Q5138379) (← links)
- Shared-memory mutual exclusion: major research trends since 1986 (Q5138486) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Convex Invariant Refinement by Control Node Splitting: a Heuristic Approach (Q5170180) (← links)
- Modelling mutual exclusion in a process algebra with time-outs (Q6053409) (← links)
