Pages that link to "Item:Q1079945"
From MaRDI portal
The following pages link to On interprocess communication. I: Basic formalism (Q1079945):
Displaying 50 items.
- Event-based proof of the mutual exclusion property of Peterson's algorithm (Q271900) (← links)
- The time complexity of updating snapshot memories (Q293175) (← links)
- Concurrent abstract state machines (Q303691) (← links)
- Distributed universality (Q329296) (← links)
- The topology of distributed adversaries (Q360277) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- From the happened-before relation to the causal ordered set abstraction (Q433461) (← links)
- Data-stream-based global event monitoring using pairwise interactions (Q436782) (← links)
- A coded shared atomic memory algorithm for message passing architectures (Q518683) (← links)
- The computability of relaxed data structures: queues and stacks as examples (Q518927) (← links)
- Logical classification of distributed algorithms (Bakery algorithms as an example) (Q541220) (← links)
- On interprocess communication and the implementation of multi-writer atomic registers (Q672706) (← links)
- Structure of concurrency (Q685384) (← links)
- Bisimulation and action refinement (Q685407) (← links)
- Correctness and concurrent complexity of the black-white bakery algorithm (Q736464) (← links)
- A very simple construction of 1-writer multireader multivalued atomic variable (Q751791) (← links)
- Nonatomic dual bakery algorithm with bounded tokens (Q766163) (← links)
- Concurrent reading while writing revisited (Q913491) (← links)
- Adaptive progress: a gracefully-degrading liveness property (Q992505) (← links)
- Refined quorum systems (Q992512) (← links)
- A queue based mutual exclusion algorithm (Q1006897) (← links)
- Distributed algorithm to detect strong conjunctive predicates (Q1014431) (← links)
- On interprocess communication. II: Algorithms (Q1079946) (← links)
- A framework for viewing atomic events in distributed computations (Q1128710) (← links)
- A criterion for atomicity (Q1192605) (← links)
- Defining conditional independence using collapses (Q1194331) (← links)
- Modelling knowledge and action in distributed systems (Q1262142) (← links)
- A fine-grained solution to the mutual exclusion problem (Q1323338) (← links)
- On the mutual-exclusion problem -- a quest for minimal solutions (Q1329738) (← links)
- Clock construction in fully asynchronous parallel systems and PRAM simulation (Q1330417) (← links)
- Simple atomic snapshots: A linear complexity solution with unbounded time-stamps (Q1351169) (← links)
- Reasoning about causality between distributed nonatomic events (Q1402743) (← links)
- Mutual exclusion as a matter of priority (Q1625608) (← links)
- Improved time bounds for linearizable implementations of abstract data types (Q1627963) (← links)
- Optimal self-stabilizing synchronous mobile Byzantine-tolerant atomic register (Q1686114) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- Self-stabilizing timestamps (Q1884893) (← links)
- Efficient algorithms for checking the atomicity of a run of read and write operations (Q1892712) (← links)
- Simple extensions of 1-writer atomic variable constructions to multiwriter ones (Q1901695) (← links)
- Timing and causality in process algebra (Q1924998) (← links)
- Randomized registers and iterative algorithms (Q1953240) (← links)
- GeoQuorums: implementing atomic memory in mobile ad hoc networks (Q1953643) (← links)
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
- Election in fully anonymous shared memory systems: tight space bounds and algorithms (Q2097346) (← links)
- Optimal self-stabilizing mobile Byzantine-tolerant regular register with bounded timestamps (Q2110369) (← links)
- On atomic registers and randomized consensus in m\&m systems (Q2121060) (← links)
- A visit to mutual exclusion in seven dates (Q2136281) (← links)
- Leader-based de-anonymization of an anonymous read/write memory (Q2193278) (← links)
- Time-efficient read/write register in crash-prone asynchronous message-passing systems (Q2218424) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
