A topological view of partitioning arguments: reducing k-set agreement to consensus
From MaRDI portal
Publication:6536339
DOI10.1007/978-3-030-34992-9_25zbMATH Open1543.68042MaRDI QIDQ6536339FDOQ6536339
Authors: Hugo Rincon-Galeana, Kyrill Winkler, Ulrich Schmid, Sergio Rajsbaum 
Publication date: 19 April 2024
Recommendations
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- A non-topological proof for the impossibility of \(k\)-set agreement
- Unbeatable set consensus via topological and combinatorial reasoning
- A topological treatment of early-deciding set-agreement
- Tight bounds for \(k\)-set agreement
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Hundreds of impossibility results for distributed computing
- Impossibility of distributed consensus with one faulty process
- The \(k\)-simultaneous consensus problem
- The topological structure of asynchronous computability
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Generalized FLP impossibility result for t-resilient asynchronous computations
- A non-topological proof for the impossibility of \(k\)-set agreement
- Sharing memory robustly in message-passing systems
- Counting-based impossibility proofs for renaming and set agreement
- An overview of synchronous message-passing and topology
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Why extension-based proofs fail
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
Cited In (1)
This page was built for publication: A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536339)
