A Non-topological Proof for the Impossibility of k-Set Agreement-Reference-Cited by-同舟云学术

A Non-topological Proof for the Impossibility of k-Set Agreement

Published:2011 Issue: Volume: Page:108-119
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Attiya Hagit,Castañeda Armando

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-24550-3_10

Reference18 articles.

1. Attiya, H., Rajsbaum, S.: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM Journal on Computing 31(4), 1286–1313 (2002)

2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, New York (1998)

3. Borowsky, E., Gafni, E.: Generalized FLP Impossibility Result for t-Resilient Asynchronous Computations. In: Proc. 25th ACM Symposium on Theory of Computing (STOC 1993), pp. 91–100. ACM Press, New York (1993)

4. Borowsky, E., Gafni, E.: Immediate Atomic Snapshots and Fast Renaming. In: Proc. 12th ACM Symposium on Principles of Distributed Computing (PODC 1993), pp. 41-51 (1993)

5. Castañeda, A., Rajsbaum, S.: New Combinatorial Topology Upper and Lower Bounds for Renaming. In: Proc. 27th ACM Symposium on Principles of Distributed Computing (PODC 2008), pp. 295–304. ACM Press, New York (2008)

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Why Extension-Based Proofs Fail;SIAM Journal on Computing;2023-07-25

2. Why extension-based proofs fail;Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing;2019-06-23

3. Combinatorial Topology of the Standard Chromatic Subdivision and Weak Symmetry Breaking for Six Processes;Springer INdAM Series;2016

4. Counting-Based Impossibility Proofs for Renaming and Set Agreement;Lecture Notes in Computer Science;2012