Pages that link to "Item:Q5365157"
From MaRDI portal
The following pages link to Immediate atomic snapshots and fast renaming (Q5365157):
Displayed 44 items.
- The topology of distributed adversaries (Q360277) (← links)
- A non-topological proof for the impossibility of \(k\)-set agreement (Q391997) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- Topology of the immediate snapshot complexes (Q471457) (← links)
- A simple characterization of asynchronous computations (Q477089) (← links)
- Linear space bootstrap communication schemes (Q477099) (← links)
- Strong order-preserving renaming in the synchronous message passing model (Q708233) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- New combinatorial topology bounds for renaming: the lower bound (Q992504) (← links)
- Anti-\(\Omega \): the weakest failure detector for set agreement (Q992506) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
- Structure theory of flip graphs with applications to weak symmetry breaking (Q1659336) (← links)
- Bounded delay for a free address (Q1901690) (← links)
- On the importance of having an identity or, is consensus really universal? (Q1953645) (← links)
- Common2 extended to stacks and unbounded concurrency (Q1954246) (← links)
- Renaming in synchronous message passing systems with Byzantine failures (Q1954260) (← links)
- A visit to mutual exclusion in seven dates (Q2136281) (← links)
- The assignment problem (Q2232588) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Locality and checkability in wait-free computing (Q2441537) (← links)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- Asynchronous Coordination Under Preferences and Constraints (Q2835020) (← links)
- t-Resilient Immediate Snapshot Is Impossible (Q2835025) (← links)
- Tight Bounds for Asynchronous Renaming (Q3189653) (← links)
- Schlegel Diagram and Optimizable Immediate Snapshot Protocol (Q3300823) (← links)
- (Q3305190) (← links)
- The Iterated Restricted Immediate Snapshot Model (Q3511360) (← links)
- Bounds on the Step and Namespace Complexity of Renaming (Q4646446) (← links)
- (Q5091106) (← links)
- Long lived adaptive splitter and applications (Q5138373) (← links)
- An adaptive collect algorithm with applications (Q5138374) (← links)
- Randomized two-process wait-free test-and-set (Q5138376) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus (Q5179019) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity (Q5501949) (← links)
- Wait-freedom with advice (Q5918242) (← links)
- Wait-free solvability of colorless tasks in anonymous shared-memory model (Q5920219) (← links)
- Wait-free approximate agreement on graphs (Q5925616) (← links)
- Towards a practical snapshot algorithm (Q5958615) (← links)
- The solvability of consensus in iterated models extended with safe-consensus (Q6056624) (← links)
- Why Extension-Based Proofs Fail (Q6115415) (← links)