Author:
Attiya Hagit,Castañeda Armando
Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. H. Attiya, A. Paz, Counting-based impossibility proofs for renaming and set agreement, in: Proc. 26th Int’l Symposium on Distributed Computing, DISC’12, Springer Verlag, 2012 (in press).
2. The combinatorial structure of wait-free solvable tasks;Attiya;SIAM Journal on Computing,2002
3. Distributed Computing: Fundamentals, Simulations and Advanced Topics;Attiya,1998
4. Easy impossibility proofs for k-set agreement in message passing systems;Biely,2011
5. Solving k-set agreement with stable skeleton graphs;Biely,2011
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献