Publisher
Springer International Publishing
Reference19 articles.
1. H. Attiya, A. Castañeda, A non-topological proof for the impossibility of k-set agreement, in Stabilization, Safety, and Security of Distributed Systems. Lecture Notes in Computer Science, vol. 6976 (2011), pp. 108–119
2. H. Attiya, A. Castañeda, M. Herlihy, A. Paz, Upper bound on the complexity of solving hard renaming, in PODC (2013), pp. 190–199
3. H. Attiya, F. Ellen, Impossibility Results for Distributed Computing. Synthesis Lectures on Distributed Computing Theory (Morgan & Claypool, San Rafael, 2014)
4. H. Attiya, A. Paz, Counting-based impossibility proofs for renaming and set agreement, in 26th International Symposium, DISC 2012, Salvador. Lecture Notes in Computer Science, vol. 7611 (2012), pp. 356–370
5. H. Attiya, J. Welch, Distributed Computing: Fundamentals, Simulations, and Advanced Topics. Wiley Series on Parallel and Distributed Computing, 2nd edn. (Springer, Heidelberg, 2004), 432 pp.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献