$(\mathrm{anti-}\Omega^{x} \times \Sigma_{z})$ -Based k-Set Agreement Algorithms-Reference-Cited by-同舟云学术

$(\mathrm{anti-}\Omega^{x} \times \Sigma_{z})$ -Based k-Set Agreement Algorithms

Published:2010 Issue: Volume: Page:189-204
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bouzid Zohir,Travers Corentin

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-17653-1_16

Reference32 articles.

1. Alistarh, D., Gilbert, S., Guerraoui, R., Travers, C.: Of choices, failures and asynchrony: The many faces of set agreement. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol. 5878, pp. 943–953. Springer, Heidelberg (2009)

2. Anta, A.F., Rajsbaum, S., Travers, C.: Brief announcement: weakest failure detectors via an egg-laying simulation. In: PODC 2009, pp. 290–291. ACM Press, New York (2009)

3. Anta, A.F., Rajsbaum, S., Travers, C.: Weakest failure detectors via an egg-laying simulation (preliminary version). Technical report, Universidad Rey Juan Carlos. Reports on Systems and Communications, vol. IX(2) (January 2009), http://gsyc.es/tr-docs/RoSaC-2009-2.pdf

4. Lecture Notes in Computer Science;F. Bonnet,2009

5. Bonnet, F., Raynal, M.: A simple proof of the necessity of the failure detector sigma to implement an atomic register in asynchronous message-passing systems. Information Processing Letters 110(4), 153–157 (2010)

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

1. A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus;Lecture Notes in Computer Science;2019

2. Solving k-Set Agreement Using Failure Detectors in Unknown Dynamic Networks;IEEE Transactions on Parallel and Distributed Systems;2017-05-01

3. A Failure Detector for k-Set Agreement in Dynamic Systems;2015 IEEE 14th International Symposium on Network Computing and Applications;2015-09

4. The Generalized Loneliness Detector and Weak System Models for k-Set Agreement;IEEE Transactions on Parallel and Distributed Systems;2014-04

5. Parallel Consensus is Harder than Set Agreement in Message Passing;2013 IEEE 33rd International Conference on Distributed Computing Systems;2013-07