Pages that link to "Item:Q391997"

The following pages link to A non-topological proof for the impossibility of \(k\)-set agreement (Q391997):

Displaying 8 items.

• The \(k\)-simultaneous consensus problem (Q2377137) (← links)
• Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
• Read-Write Memory and k-Set Consensus as an Affine Task (Q3174927) (← links)
• \(k\)-set agreement in communication networks with omission faults (Q3174930) (← links)
• k-Immediate Snapshot and x-Set Agreement: How Are They Related? (Q6487899) (← links)
• A topological view of partitioning arguments: reducing \(k\)-set agreement to consensus (Q6536339) (← links)
• The time complexity of consensus under oblivious message adversaries (Q6547208) (← links)
• Revisionist simulations: a new approach to proving space lower bounds (Q6583675) (← links)