Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Computer Networks and Communications,Hardware and Architecture,Theoretical Computer Science
Reference25 articles.
1. Afek Y., Nir I.: Failure detectors in loosely named systems. In: Bazzi, R.A., Patt-Shamir, B. (eds) PODC, pp. 65–74. ACM, New York (2008)
2. Afek, Y., Stupp, G., Touitou, D.: Long-lived and adaptive atomic snapshot and immediate snapshot. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC-00), pp. 71–80, New York, July 16–19 (2000). ACM Press.
3. Afek, Y., Gafni, E., Rajsbaum, S., Raynal, M.: Travers corentin: simultaneous consensus tasks: a tighter characterization of set-consensus. Distributed Comput. 22(3) (2010)
4. Attiya, H.: A direct lower bound for k-set consensus. In: PODC, p. 314 (1998)
5. Borowsky, E., Gafni, E.: Generalized FLP impossibility result for t-resilient asynchronous computations. In: Aggarwal, A. (ed.) Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, pp. 91–100, San Diego, May. ACM Press, ISBN 0-89791-591-7 (1993a)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Anonymity-Preserving Failure Detectors;Lecture Notes in Computer Science;2016
2. A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling;Structural Information and Communication Complexity;2015
3. Wait-freedom with advice;Distributed Computing;2014-10-17
4. Parallel Consensus is Harder than Set Agreement in Message Passing;2013 IEEE 33rd International Conference on Distributed Computing Systems;2013-07
5. Renaming and the weakest family of failure detectors;Distributed Computing;2012-09-02