Abortable Shared Objects, Brief annoucement in Proc. 20th Symposium on Distributed Computing Springer-Verlag LNCS #4167, pp.534-536, 2006. ,
Time-Adaptive Algorithms for Synchronization, SIAM Journal on Computing, vol.26, issue.2, pp.539-556, 1997. ,
DOI : 10.1137/S0097539794265244
Fast timing-based algorithms, Distributed Computing, pp.1-10, 1996. ,
DOI : 10.1007/s004460050020
Another Advantage of Free Choice: Completely Asynchronous Agreement Protocols, Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83), pp.27-30, 1983. ,
Bounds on Shared Memory for Mutual Exclusion, Information and Computation, vol.107, issue.2, pp.171-184, 1993. ,
DOI : 10.1006/inco.1993.1065
The ambiguity of choosing, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.145-158, 1989. ,
DOI : 10.1145/72981.72991
Unreliable failure detectors for reliable distributed systems, Journal of the ACM, vol.43, issue.2, pp.225-267, 1996. ,
DOI : 10.1145/226643.226647
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
Indulgent Algorithms, Proc. 19th ACM Symposium on Principles of Distributed Computing, pp.289-298, 2000. ,
URL : https://hal.archives-ouvertes.fr/hal-00992775
The Weakest failure Detectors to Boost Obstruction-Freedom, Proc. 20th Symposium on Distributed Computing (DISC'06 Springer-Verlag LNCS #4167, pp.376-390, 2006. ,
A General Characterization of Indulgence, Proc. 8th Int'l Symposium on Self-stabilization, Safety and Security of Distributed Systems (SSS'06), 2006. ,
The information structure of indulgent consensus, IEEE Transactions on Computers, vol.53, issue.4, pp.453-466, 2004. ,
DOI : 10.1109/TC.2004.1268403
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 synchronization: double-ended queues as an example, 23rd International Conference on Distributed Computing Systems, 2003. Proceedings., pp.522-529, 2003. ,
DOI : 10.1109/ICDCS.2003.1203503
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
Proving the Correctness of Multiprocess Programs, IEEE Transactions on Software Engineering, vol.3, issue.2, pp.125-143, 1977. ,
DOI : 10.1109/TSE.1977.229904
On Interprocess Communication, Part II: Algorithms. Distributed Computing, pp.86-101, 1986. ,
A fast mutual exclusion algorithm, ACM Transactions on Computer Systems, vol.5, issue.1, pp.1-11, 1987. ,
DOI : 10.1145/7351.7352
Memory Requirements for Agreement among Unreliable Asynchronous Processes Advances in Computing Research, pp.163-183, 1987. ,
Timing-based mutual exclusion, [1992] Proceedings Real-Time Systems Symposium, p.211, 1992. ,
DOI : 10.1109/REAL.1992.242681
Conditions on input vectors for consensus solvability in asynchronous distributed systems, Journal of the ACM, vol.50, issue.6, pp.922-954, 2003. ,
DOI : 10.1145/950620.950624
Sticky bits and universality of consensus, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing , PODC '89, pp.159-175, 1989. ,
DOI : 10.1145/72981.72992
Algorithms for mutual exclusion, 1986. ,
URL : https://hal.archives-ouvertes.fr/inria-00075198
A short introduction to failure detectors for asynchronous distributed systems, ACM SIGACT News, vol.36, issue.1, pp.53-70, 2005. ,
DOI : 10.1145/1052796.1052806
Computing in the Presence of Timing Failures, 26th IEEE International Conference on Distributed Computing Systems (ICDCS'06), 2006. ,
DOI : 10.1109/ICDCS.2006.21
Synchronization Algorithms and Concurrent Programming, 2006. ,