Recommendations
Cited in
(81)- From adaptive renaming to set agreement
- Fault-tolerant critical section management in asynchronous environments
- Wait-free implementations in message-passing systems
- Knowledge in shared memory systems.
- Stability of long-lived consensus.
- On modelling mobility
- A classification of wait-free loop agreement tasks
- Bounded delay for a free address
- Renaming and the weakest family of failure detectors
- Lock-free dynamic hash tables with open addressing
- On the importance of having an identity or, is consensus really universal?
- Renaming in synchronous message passing systems with Byzantine failures
- A visit to mutual exclusion in seven dates
- Extending the wait-free hierarchy to multi-threaded systems
- Waiting in concurrent algorithms
- The assignment problem
- Fast rendezvous on a cycle by agents with different speeds
- Deterministic multi-channel information exchange
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Locality and checkability in wait-free computing
- Algebraic topology and concurrency
- Topology recognition with advice
- scientific article; zbMATH DE number 1696671 (Why is no real title available?)
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- Asynchronous coordination under preferences and constraints
- t-resilient immediate snapshot Is impossible
- An equivariance theorem with applications to renaming
- Locality and checkability in wait-free computing
- Oblivious Collaboration
- Tight bounds for asynchronous renaming
- Progress-space tradeoffs in single-writer memory implementations
- Anonymous processors with synchronous shared memory: Monte Carlo algorithms
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- Renaming in Message Passing Systems with Byzantine Failures
- The topology of distributed adversaries
- Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus
- Distributed name assignment in computer networks
- Solving the at-most-once problem with nearly optimal effectiveness
- Computing with infinitely many processes
- Power and limits of distributed computing shared memory models
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- Bounds on the step and namespace complexity of renaming
- The renaming problem in shared memory systems: an introduction
- Linear space bootstrap communication schemes
- An equivariance theorem with applications to renaming
- The renaming problem: recent developments and open questions
- Closed schedulers: a novel technique for analyzing asynchronous protocols
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- The BG distributed simulation algorithm
- An adaptive collect algorithm with applications
- Adaptive and efficient mutual exclusion
- Hundreds of impossibility results for distributed computing
- What can be computed in a distributed system?
- Byzantine renaming in synchronous systems with \(t < N\)
- An inductive-style procedure for counting monochromatic simplexes of symmetric subdivisions with applications to distributed computing
- Brief announcement: Asynchronous coordination with constraints and preferences
- From Renaming to Set Agreement
- Weak symmetry breaking and abstract simplex paths
- A closer look at fault tolerance
- Wait-freedom with advice
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
- Topology recognition and leader election in colored networks
- Tasks in modular proofs of concurrent algorithms
- The solvability of consensus in iterated models extended with safe-consensus
- Set agreement and renaming in the presence of contention-related crash failures
- Tasks in modular proofs of concurrent algorithms
- Efficient and robust sharing of memory in message-passing systems (extended abstract)
- Simulating reliable links with unreliable links in the presence of process crashes
- The combinatorial structure of wait-free solvable tasks (extended abstract)
- Fully-adaptive algorithms for long-lived renaming
- Algebraic topology and distributed computing
- Distributed computing in the asynchronous LOCAL model
- Tight bounds on the round complexity of distributed 1-solvable tasks
- Locally solvable tasks and the limitations of valency arguments
- Optimal resilience in systems that mix shared memory and message passing
- Relaxed queues and stacks from read/write operations
- Generating fast indulgent algorithms
- Strong order-preserving renaming in the synchronous message passing model
- New combinatorial topology bounds for renaming: the lower bound
This page was built for publication: Renaming in an asynchronous environment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3477940)
