Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993. ,
DOI : 10.1145/153724.153741
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus, Proc. 8th Int'l Conference on Distributed Computing and Networking (ICDCN'06), pp.331-341, 2006. ,
DOI : 10.1007/11947950_36
Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990. ,
DOI : 10.1145/79147.79158
) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998. ,
DOI : 10.1137/S0097539795279463
Distributed Computing, Fundamentals, Simulation and Advanced Topics, Wiley Series on Parallel and Distributed Computing, p.414, 2004. ,
-resilient asynchronous computations, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.91-100, 1993. ,
DOI : 10.1145/167088.167119
URL : https://hal.archives-ouvertes.fr/hal-00896459
The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001. ,
DOI : 10.1007/PL00008933
New combinatorial topology upper and lower bounds for renaming, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, PODC '08, pp.295-304, 2008. ,
DOI : 10.1145/1400751.1400791
More Choices Allow More Faults: Set Consensus Problems in Totally Asynchronous Systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993. ,
DOI : 10.1006/inco.1993.1043
Impossibility of distributed consensus with one faulty process, Journal of the ACM, vol.32, issue.2, pp.374-382, 1985. ,
DOI : 10.1145/3149.214121
Round-by-round Fault Detectors: Unifying Synchrony and Asynchrony, Proc. 17th ACM Symposium on Principles of Distributed Computing (PODC'98), pp.143-152, 1998. ,
DOI : 10.1145/277697.277724
The extended BG-simulation and the characterization of t-resiliency, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, 2009. ,
DOI : 10.1145/1536414.1536428
The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999. ,
DOI : 10.1145/331524.331529
Memory Requirements for Agreement Among Unreliable Asynchronous Processes, of Advances in Comp. Research, pp.163-183, 1987. ,
Distributed Algorithms, 1996. ,
-set agreement is impossible, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing , STOC '93, pp.1449-1483, 2000. ,
DOI : 10.1145/167088.167122
URL : https://hal.archives-ouvertes.fr/hal-00192526