Pages that link to "Item:Q1079946"
From MaRDI portal
The following pages link to On interprocess communication. II: Algorithms (Q1079946):
Displaying 50 items.
- Efficient test \& set constructions for faulty shared memory (Q287031) (← links)
- The time complexity of updating snapshot memories (Q293175) (← links)
- Invariants for the construction of a handshake register (Q293438) (← links)
- Dynamic regular registers in systems with churn (Q392005) (← links)
- Linear space bootstrap communication schemes (Q477099) (← links)
- The mailbox problem (Q661002) (← links)
- Wait-free regular storage from Byzantine components (Q845896) (← links)
- Blocking versus nonblocking interprocess communication: A note on the effect on concurrency (Q917284) (← links)
- Adaptive progress: a gracefully-degrading liveness property (Q992505) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- On interprocess communication. I: Basic formalism (Q1079945) (← links)
- Atomic semantics of nonatomic programs (Q1111361) (← links)
- Converting Lamport's regular register to atomic register (Q1114404) (← links)
- The behavior of shared objects: Concept, pitfalls, and a new model (Q1119023) (← links)
- Towards an understanding of unbounded variables in asynchronous systems (Q1198014) (← links)
- Optimality of wait-free atomic multiwriter variables (Q1199944) (← links)
- Linearizable read/write objects (Q1292436) (← links)
- Global serializability of concurrent programs (Q1318722) (← links)
- Clock construction in fully asynchronous parallel systems and PRAM simulation (Q1330417) (← links)
- The difference between splitting in \(n\) and \(n+1\) (Q1370654) (← links)
- The entropy of a distributed computation random number generation from memory interleaving (Q1656885) (← links)
- Leader election in the presence of n-1 initial failures (Q1825627) (← links)
- The power of multiobjects. (Q1854306) (← links)
- Probabilistic quorum systems (Q1854466) (← links)
- Randomized registers and iterative algorithms (Q1953240) (← links)
- Nonatomic mutual exclusion with local spinning (Q1954193) (← links)
- Randomized consensus with regular registers (Q2059870) (← links)
- Step-optimal implementations of large single-writer registers (Q2182649) (← links)
- The assignment problem (Q2232588) (← links)
- Tight space bounds for \(\ell\)-exclusion (Q2251155) (← links)
- Relaxed data types as consistency conditions (Q2283840) (← links)
- Possible values: exploring a concept for concurrency (Q2374311) (← links)
- Byzantine disk paxos: optimal resilience with Byzantine shared memory (Q2375303) (← links)
- Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos (Q2377304) (← links)
- Relationships between memory models (Q2390217) (← links)
- Time and space optimal implementations of atomic multi-writer register (Q2486400) (← links)
- Definability and decidability of binary predicates for time granularity (Q2495389) (← links)
- Self-stabilizing and private distributed shared atomic memory in seldomly fair message passing networks (Q2700388) (← links)
- A note on a location-independent inter-process communication scheme for dynamic multiagent systems (Q2785832) (← links)
- Concurrent Use of Write-Once Memory (Q2835021) (← links)
- Of Concurrent Data Structures and Iterations (Q3464481) (← links)
- Introduction à l'algorithmique des objets partagés (Q4349778) (← links)
- Linear-time snapshot implementations in unbalanced systems (Q4850334) (← links)
- A case study in transformational design of concurrent systems (Q5044728) (← links)
- On self-stabilizing wait-free clock synchronization (Q5054767) (← links)
- (Q5090901) (← links)
- Naming symmetric processes using shared variables (Q5136976) (← links)
- On the use of registers in achieving wait-free consensus (Q5137333) (← links)
- Synchronous Byzantine quorum systems (Q5137894) (← links)
- Randomized two-process wait-free test-and-set (Q5138376) (← links)
