Brief Announcement: Why Extension-Based Proofs Fail
PODC '20: ACM Symposium on Principles of Distributed Computing Virtual Event Italy August, 2020, pp. 54-56, 2020.
We introduce extension-based proofs, a class of impossibility proofs that includes valency arguments. They are modelled as an interaction between a prover and a protocol. Using proofs based on combinatorial topology, it has been shown that it is impossible to deterministically solve k-set agreement among n > k ≥ 2 processes in a wait-free...More
Full Text (Upload PDF)
PPT (Upload PPT)