Author:
Castañeda Armando,Rajsbaum Sergio
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference32 articles.
1. Attiya H., Rajsbaum S.: The combinatorial structure of wait-free solvable tasks. SIAM J. Comput. 31(4), 1286–1313 (2002)
2. Attiya H., Bar-Noy A., Dolev D.: Sharing memory robustly in message-passage systems. J. ACM 42(1), 124–142 (1995)
3. Attiya H., Bar-Noy A., Dolev D., Peleg D., Reischuck R.: Renaming in asynchronous environment. J. ACM 37(3), 524–548 (1990)
4. Attiya H., Welch J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, NY (1998)
5. Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. Proceedings of the 25th Annual ACM Symposium on Theory of Computing, pp. 91–100 (1993)
Cited by
36 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献