Pages that link to "Item:Q4568311"
From MaRDI portal
The following pages link to Impossibility Results for Distributed Computing (Q4568311):
Displaying 6 items.
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- Recent Results on Fault-Tolerant Consensus in Message-Passing Networks (Q2835019) (← links)
- Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes (Q4608477) (← links)
- A Tight Space Bound for Consensus (Q4997312) (← links)
- On the optimal space complexity of consensus for anonymous processes (Q5915696) (← links)
- Why Extension-Based Proofs Fail (Q6115415) (← links)
