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 QIDQ6536339
Sergio Rajsbaum, Hugo Rincon-Galeana, Ulrich Schmid, Kyrill Winkler
Publication date: 19 April 2024
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15)
Cites Work
- A non-topological proof for the impossibility of \(k\)-set agreement
- On the road to the weakest failure detector for \(k\)-set agreement in message-passing systems
- The \(k\)-simultaneous consensus problem
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- An overview of synchronous message-passing and topology
- The topological structure of asynchronous computability
- Impossibility of distributed consensus with one faulty process
- Sharing memory robustly in message-passing systems
- Counting-Based Impossibility Proofs for Renaming and Set Agreement
- Wait-Free k-Set Agreement is Impossible: The Topology of Public Knowledge
- Hundreds of impossibility results for distributed computing
- Why extension-based proofs fail
- Generalized FLP impossibility result for t-resilient asynchronous computations
- A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
Related Items (1)
This page was built for publication: A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus
