Concurrent programming: algorithms, principles, and foundations.
From MaRDI portal
Cited in
(58)- Object-based concurrent programming. ECOOP '91, Workshop, Geneva, Switzerland, July 15-16, 1991, Proceedings
- The entropy of a distributed computation random number generation from memory interleaving
- Randomized k-set agreement in crash-prone and Byzantine asynchronous systems
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- Election in fully anonymous shared memory systems: tight space bounds and algorithms
- Moded and continuous abstract state machines
- The epigenetic consensus problem
- A visit to mutual exclusion in seven dates
- Extending the wait-free hierarchy to multi-threaded systems
- Leader-based de-anonymization of an anonymous read/write memory
- Time-efficient read/write register in crash-prone asynchronous message-passing systems
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- Mutual exclusion in fully anonymous shared memory systems
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Atomic read/write memory in signature-free Byzantine asynchronous message-passing systems
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^2)\) messages, and constant time
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- Recent results on fault-tolerant consensus in message-passing networks
- Asynchronous coordination under preferences and constraints
- t-resilient immediate snapshot Is impossible
- Simultaneous consensus vs set agreement: a message-passing-sensitive hierarchy of agreement problems
- Distributed universality
- Communication patterns and input patterns in distributed computing (invited talk)
- Signature-free asynchronous Byzantine systems: from multivalued to binary consensus with \(t<n/3\), \(O(n^{2})\) messages, and constant time
- Power and limits of distributed computing shared memory models
- scientific article; zbMATH DE number 47171 (Why is no real title available?)
- scientific article; zbMATH DE number 48617 (Why is no real title available?)
- scientific article; zbMATH DE number 108539 (Why is no real title available?)
- scientific article; zbMATH DE number 1206113 (Why is no real title available?)
- scientific article; zbMATH DE number 1049169 (Why is no real title available?)
- scientific article; zbMATH DE number 195214 (Why is no real title available?)
- scientific article; zbMATH DE number 3992925 (Why is no real title available?)
- Linear space bootstrap communication schemes
- scientific article; zbMATH DE number 839544 (Why is no real title available?)
- Concurrent crash-prone shared memory systems. A few theoretical notions
- A simple object that spans the whole consensus hierarchy
- Lattice agreement in message passing systems
- What can be computed in a distributed system?
- Concurrency. The works of Leslie Lamport
- Contention-sensitive data structures and algorithms
- Making local algorithms wait-free: the case of ring coloring
- Tasks in modular proofs of concurrent algorithms
- Modelling mutual exclusion in a process algebra with time-outs
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
- Reaching agreement in the presence of contention-related crash failures
- Reaching consensus in the presence of contention-related crash failures
- About informatics, distributed computing, and our job: a personal view
- Tasks in modular proofs of concurrent algorithms
- Relaxed queues and stacks from read/write operations
- The computational power of distributed shared-memory models with bounded-size registers
- Process-algebraic models of multi-writer multi-reader non-atomic registers
- The computational power of distributed shared-memory models with bounded-size registers
- Asynchronous wait-free runtime verification and enforcement of linearizability
- Byzantine-tolerant distributed grow-only sets: specification and applications
- Just verification of mutual exclusion algorithms
- Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
This page was built for publication: Concurrent programming: algorithms, principles, and foundations.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3166386)
