Pages that link to "Item:Q3485850"
From MaRDI portal
The following pages link to A combinatorial characterization of the distributed 1-solvable tasks (Q3485850):
Displaying 27 items.
- The topology of distributed adversaries (Q360277) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- The minimum information about failures for solving non-local tasks in message-passing systems (Q661069) (← links)
- Tight bounds on the round complexity of distributed 1-solvable tasks (Q673104) (← links)
- Strongly terminating early-stopping \(k\)-set agreement in synchronous systems with general omission failures (Q987393) (← links)
- Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
- An algorithmic approach to the asynchronous computability theorem (Q1616400) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- A simplicial complex model for dynamic epistemic logic to study distributed task computability (Q2029604) (← links)
- A dynamic epistemic logic analysis of equality negation and other epistemic covering tasks (Q2043796) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- (Q3305190) (← links)
- (Q3384879) (← links)
- Communication Complexity of Wait-Free Computability in Dynamic Networks (Q5100966) (← links)
- Closed schedulers: a novel technique for analyzing asynchronous protocols (Q5136996) (← links)
- The BG distributed simulation algorithm (Q5138357) (← links)
- Hundreds of impossibility results for distributed computing (Q5138488) (← links)
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols (Q5138500) (← links)
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus (Q5179019) (← links)
- Untangling Partial Agreement: Iterated x-consensus Simulations (Q5207909) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)
- Wait-free computing (Q6062513) (← links)
- Impure Simplicial Complexes: Complete Axiomatization (Q6076177) (← links)
- On the Validity of Consensus (Q6202272) (← links)
- The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
- The combinatorial structure of wait-free solvable tasks (extended abstract) (Q6570926) (← links)
- On the robustness of \(h^r_m\) (preliminary version) (Q6570927) (← links)
