Computing in totally anonymous asynchronous shared memory systems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1418469 (Why is no real title available?)
- A Lower Bound on Wait-Free Counting
- Bounds on shared memory for mutual exclusion
- Closed schedulers: a novel technique for analyzing asynchronous protocols
- Computing on an anonymous ring
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- On the space complexity of randomized synchronization
- Possibility and impossibility results in a shared memory environment
- Reaching Agreement in the Presence of Faults
- The Byzantine Generals Problem
- The Wakeup Problem
- Time and Space Lower Bounds for Nonblocking Implementations
Cited in
(25)- Byzantine agreement with homonyms in synchronous systems
- Computing with infinitely many processes
- Anonymous and fault-tolerant shared-memory computing
- Fast rendezvous on a cycle by agents with different speeds
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- Byzantine agreement with homonyms
- Fault-tolerant consensus with an abstract MAC layer
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Hundreds of impossibility results for distributed computing
- A visit to mutual exclusion in seven dates
- On the importance of having an identity or, is consensus really universal?
- Leader-based de-anonymization of an anonymous read/write memory
- Relationships Between Broadcast and Shared Memory in Reliable Anonymous Distributed Systems
- The computational power of population protocols
- Anonymous Shared Memory
- scientific article; zbMATH DE number 7515766 (Why is no real title available?)
- Agreeing within a few writes
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- Mutual exclusion in fully anonymous shared memory systems
- A knowledge-based analysis of global function computation
- Efficient algorithms for anonymous Byzantine agreement
- Election in fully anonymous shared memory systems: tight space bounds and algorithms
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Relationships between broadcast and shared memory in reliable anonymous distributed systems
- Anonymous processors with synchronous shared memory: Monte Carlo algorithms
This page was built for publication: Computing in totally anonymous asynchronous shared memory systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854512)
