, Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993.
DOI : 10.1145/153724.153741
, A bounded first-in, first-enabled solution to the l-exclusion problem, ACM Transactions on Programming Languages and Systems, vol.16, issue.3, pp.939-953, 1994.
DOI : 10.1145/177492.177731
, 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
, ) Operations, SIAM Journal on Computing, vol.27, issue.2, pp.319-340, 1998.
DOI : 10.1137/S0097539795279463
, The Combinatorial Structure of Wait-Free Solvable Tasks, SIAM Journal on Computing, vol.31, issue.4, pp.1286-1313, 2002.
DOI : 10.1137/S0097539797330689
, Distributed Computing: Fundamentals, Simulations, and Advanced T opics, 2004.
DOI : 10.1002/0471478210
, Immediate atomic snapshots and fast renaming, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.41-51, 1993.
DOI : 10.1145/164051.164056
, -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
, A Simple Algorithmically Reasoned Characterization of Wait-free Computations, Proc. 16th ACM Symp. on Principles of Distributed Computing (PODC'97, pp.189-198, 1997.
, Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996.
DOI : 10.1145/226643.226647
, The weakest failure detector for solving consensus, Journal of the ACM, vol.43, issue.4, pp.685-722, 1996.
DOI : 10.1145/234533.234549
, 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
, The concurrency hierarchy, and algorithms for unbounded concurrency, Proceedings of the twentieth annual ACM symposium on Principles of distributed computing , PODC '01, pp.161-169, 2001.
DOI : 10.1145/383962.384008
, Subconsensus Tasks: Renaming Is Weaker Than Set Agreement, Proc. 20th Int'l Symposium on Distributed Computing (DISC'06), pp.329-338, 2006.
DOI : 10.1007/11864219_23
, The Alpha of Indulgent Consensus, The Computer Journal, vol.50, issue.1, pp.53-67, 2007.
DOI : 10.1093/comjnl/bxl046
, Gamma-accurate Failure Detectors, Proc. 1Oth Int'l Workshop on Distributed Algorithms (WDAG'96), pp.269-286, 1996.
, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991.
DOI : 10.1145/114005.102808
, Tight Bounds for k-Set Agreement with Limited Scope Accuracy Failure Detectors, Distributed Computing, pp.157-166, 2005.
, Unifying synchronous and asynchronous message-passing models, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.133-142, 1998.
DOI : 10.1145/277697.277722
, The topological structure of asynchronous computability, Journal of the ACM, vol.46, issue.6, pp.858-923, 1999.
DOI : 10.1145/331524.331529
, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, vol.12, issue.3, pp.463-492, 1990.
DOI : 10.1145/78969.78972
, On Interprocess Communication, Part II: Algorithms. Distributed Computing, pp.86-101, 1986.
, Distributed A lgorithms, 1997.
, On the Computability Power and the Robustness of Set Agreement-oriented Failure Detector Classes An extended abstract appeared as: Irreducibility and Additivity of Set Agreement-oriented Failure Detector Classes, Proc. 25th ACM Symposium on Principles of Distributed Computing (PODC'06), A CM Press, pp.153-162, 2006.
, Unreliable Failure Detectors with Limited Scope Accuracy and an Application to Consensus, Proc. 19th Int'l Conference on Foundations of Software Technology and Theoretical Computer Science (FST&TCS'99) Springer Verlag LNCS #1738, pp.329-340, 1999.
DOI : 10.1007/3-540-46691-6_26
, Solving Consensus Using Chandra-Toueg???s Unreliable Failure Detectors: A General Quorum-Based Approach, Proc. 13th Int'l Symposium on Distributed Computing (DISC'99 Springer-Verlag LNCS 1693, pp.49-63, 1999.
DOI : 10.1007/3-540-48169-9_4
, k-set agreement with limited accuracy failure detectors, Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing , PODC '00, pp.143-152, 2000.
DOI : 10.1145/343477.343536
, Brief Announcement, Proc. 13th ACM Symposium on Principles of Distributed Computing (PODC'94), A CM Press, p.396, 1994.
, Failure Detectors and the Wait-free Hierarchy, Proc. 14th ACM Symposium on Principles of Distributed Computing (PODC'95), A CM Press, pp.100-109, 1995.
, In Search of the Holy Grail: Looking for the Weakest Failure Detector for Wait-Free Set Agreement, Proc. 10th Int'l Conference On Principles Of Distributed Systems (OPODIS'06), pp.1-17, 2006.
DOI : 10.1007/11945529_2
URL : https://hal.archives-ouvertes.fr/inria-00089977
, -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
, Structured derivations of consensus algorithms for failure detectors, Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing , PODC '98, pp.297-308, 1998.
DOI : 10.1145/277697.277755