A topological view of partitioning arguments: reducing k-set agreement to consensus
From MaRDI portal
Publication:6536339
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
Cites work
- A non-topological proof for the impossibility of \(k\)-set agreement
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
- An overview of synchronous message-passing and topology
- Counting-based impossibility proofs for renaming and set agreement
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Hundreds of impossibility results for distributed computing
- Impossibility of distributed consensus with one faulty process
- On the road to the weakest failure detector for k-set agreement in message-passing systems
- Sharing memory robustly in message-passing systems
- The \(k\)-simultaneous consensus problem
- The topological structure of asynchronous computability
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Why extension-based proofs fail
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)
