Common2 Extended to Stacks and Unbounded Concurrency, Proc. 25 ACM symposium on Principles of distributed computing (PODC'06), pp.218-227, 2006. ,
A completeness theorem for a class of synchronization objects, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing , PODC '93, pp.159-170, 1993. ,
DOI : 10.1145/164051.164071
Distributed Computing: Fundamentals, Simulations and Advanced Topics, p.414, 2004. ,
DOI : 10.1002/0471478210
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
N-Consensus is the Second Strongest Object for N???+???1 Processes, Proc. 11th Int'l Conference On Principle Of Distributed Systems, pp.260-273, 2007. ,
DOI : 10.1007/978-3-540-77096-1_19
From adaptive renaming to set agreement, 26th IEEE Symposium on Reliable Distributed Systems (SRDS'07), pp.93-102, 2007. ,
DOI : 10.1016/j.tcs.2008.05.016
URL : https://hal.archives-ouvertes.fr/hal-00432970
Wait-free synchronization, ACM Transactions on Programming Languages and Systems, vol.13, issue.1, pp.124-149, 1991. ,
DOI : 10.1145/114005.102808
Obstruction-free synchonization: double-ended queues as an example, Proc. 23th Int'l IEEE Conference on Distributed Computing Systems (ICDCS'03), pp.522-529, 2003. ,
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, Distributed Computing, vol.21, issue.2, pp.77-101, 1986. ,
DOI : 10.1007/BF01786227
Distributed Algorithms, 1996. ,
Synchronization Algorithms and Concurrent Programming, 2006. ,
Contention-Sensitive Data Structure and Algorithms, Proc. 23th Int'l Symposium on Distributed Computing (DISC'09), Springer Verlag LNCS #5805, pp.157-171, 2009. ,
On the Computational Power of Shared Objects, Proc. 13th Int'l Conference On Principle Of Distributed Systems, pp.270-284, 2009. ,
DOI : 10.1007/978-3-642-10877-8_22