Atomic snapshots of shared memory, Journal of the ACM, vol.40, issue.4, pp.873-890, 1993. ,
DOI : 10.1145/153724.153741
URL : http://www.math.tau.ac.il/~shanir/publications/AADGMS.ps
Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990. ,
DOI : 10.1145/79147.79158
Anonymous obstruction-free (n,??k)-set agreement with
$$n-k+1$$
n
-
k
+
1
atomic read/write registers, 19th International Conference on Principles of Distributed Systems, OPODIS '15, pp.1-1817, 2015. ,
DOI : 10.1145/2897518.2897565
Bounds on shared memory for mutual exclusion, Information and Computation, vol.107, issue.2, pp.171-184, 1993. ,
Safety-Liveness Exclusion in Distributed Computing, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.227-236, 2015. ,
DOI : 10.1145/2220357.2220360
URL : http://infoscience.epfl.ch/record/207929/files/exclusionMain_1.pdf
Adaptive Register Allocation with a Linear Number of Registers, International Symposium on Distributed Computing, DISC '13, pp.269-283, 2013. ,
DOI : 10.1007/978-3-642-41527-2_19
URL : https://hal.archives-ouvertes.fr/hal-00922425
Black art: Obstruction-free k-set agreement with |mwmr registers| < |proccesses|, 1st International Conference on Networked Systems, NETYS '13, pp.28-41, 2013. ,
DOI : 10.1007/978-3-642-40148-0_3
URL : https://hal.archives-ouvertes.fr/hal-00922423
Linear space bootstrap communication schemes, Theoretical Computer Science, vol.561, pp.122-133, 2015. ,
DOI : 10.1016/j.tcs.2014.10.013
URL : https://hal.archives-ouvertes.fr/hal-00922420
On the Space Complexity of Set Agreement?, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, PODC '15, pp.271-280, 2015. ,
DOI : 10.1145/277697.277755
URL : https://hal.archives-ouvertes.fr/hal-01251563
Time-space tradeoffs for implementations of snapshots, Proceedings of the thirty-eighth annual ACM symposium on Theory of computing , STOC '06, pp.169-178, 2006. ,
DOI : 10.1145/1132516.1132542
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
URL : http://research.sun.com/people/moir/Papers/ICDCS2003.pdf
Time and space lower bounds for non-blocking implementations (preliminary version), Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing , PODC '96, pp.257-266, 1996. ,
DOI : 10.1145/248052.248105
On interprocess communication; part I and II. Distributed Computing, pp.77-101, 1986. ,
DOI : 10.1007/bf01786228
URL : http://www.dtic.mil/cgi-bin/GetTRDoc?AD=ADA156337&Location=U2&doc=GetTRDoc.pdf
On a problem of formal logic, Proceedings of the London Mathematical Society, pp.264-286, 1930. ,
DOI : 10.1007/978-0-8176-4842-8_1
Contention-sensitive data structures and algorithms, 23rd International Conference on Distributed Computing, DISC'09, pp.157-171, 2009. ,
DOI : 10.1007/978-3-642-04355-0_17
Wait-free solvability of colorless tasks in anonymous shared-memory model, 18th International Symposium on Stabilization, Safety, and Security of Distributed Systems, SSS '06, pp.415-429, 2016. ,
DOI : 10.1007/s00224-017-9819-0
A tight space bound for consensus, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, pp.345-350, 2016. ,
DOI : 10.1145/114005.102808