Local and global properties in networks of processors, 12th Annual ACM Symposium on Theory of Computing (STOC), pp.82-93, 1980. ,
Adapting to Point Contention with Long-Lived Safe Agreement, 13th Int. Conf. Structural Information and Communication Complexity (SIROCCO), vol.4056, pp.10-23, 2006. ,
Computing in totally anonymous asynchronous shared memory systems, Information and Computation, vol.173, issue.2, pp.162-183, 2002. ,
DOI : 10.1007/bfb0056473
Value-based sequential consistency for set objects in dynamic distributed systems, 16th International Euro-Par Conference, vol.6271, pp.523-534, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00543132
Implementing set objects in dynamic distributed systems, Journal of Computer and System Sciences, vol.82, issue.5, pp.654-689, 2016. ,
The BG distributed simulation algorithm, Distributed Computing, vol.14, issue.3, pp.127-146, 2001. ,
Anonymity-Preserving Failure Detectors, 30th International Symposium Distributed Computing (DISC), vol.9888, pp.173-186, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01344446
On the uncontended complexity of anonymous agreement. Distributed Computing, vol.30, pp.459-468, 2017. ,
The renaming problem in shared memory systems: An introduction, Comput. Sci. Rev, vol.5, issue.3, pp.229-251, 2011. ,
Generalized symmetry breaking tasks and nondeterminism in concurrent objects, SIAM Journal on Computing, vol.45, issue.2, pp.379-414, 2016. ,
More choices allow more faults: Set consensus problems in totally asynchronous systems, Information and Computation, vol.105, issue.1, pp.132-158, 1993. ,
Two consensus algorithms with atomic registers and failure detector ?, 10th International Conference on Distributed Computing and Networking (ICDCN), vol.5408, pp.251-262, 2009. ,
Linear space bootstrap communication schemes, Special Issue on Distributed Computing and Networking, vol.561, pp.122-133, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01251557
Sergio Rajsbaum, and Nayuta Yanagisawa. An anonymous wait-free weak-set object implementation, 6th International Conference on Networked Systems (NETYS), 2018. ,
The space complexity of unbounded timestamps, Distributed Computing, vol.21, issue.2, pp.103-115, 2008. ,
Impossibility of distributed consensus with one faulty process, J. ACM, vol.32, issue.2, pp.374-382, 1985. ,
Three-processor tasks are undecidable, SIAM Journal on Computing, vol.28, issue.3, pp.970-983, 1999. ,
On the Optimal Space Complexity of Consensus for Anonymous Processes, 30th International Symposium Distributed Computing (DISC), pp.452-466, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01207153
Anonymous and fault-tolerant sharedmemory computing, Distributed Computing, vol.20, issue.3, pp.165-177, 2007. ,
Distributed computing through combinatorial topology, 2013. ,
The decidability of distributed decision tasks (extended abstract), 29th Annual ACM Symposium on Theory of Computing (STOC), pp.589-598, 1997. ,
A classification of wait-free loop agreement tasks, Theoretical Computer Science, vol.291, issue.1, pp.55-77, 2003. ,
The topology of shared-memory adversaries, 29th ACM Symposium on Principles of Distributed Computing (PODC), pp.105-113, 2010. ,
Simulations and reductions for colorless tasks, 31th ACM symposium on Principles of distributed computing, PODC '12, pp.253-260, 2012. ,
From waitfree to arbitrary concurrent solo executions in colorless distributed computing, Theor. Comput. Sci, vol.683, pp.1-21, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01660566
The topological structure of asynchronous computability, J. ACM, vol.46, issue.6, pp.858-923, 1999. ,
The Art of Multiprocessor Programming, 2008. ,
Linearizability: A correctness condition for concurrent objects, ACM Trans. Program. Lang. Syst, vol.12, issue.3, pp.463-492, 1990. ,
Wakeup under read/write atomicity, 4th International Workshop on Distributed Algorithms, pp.277-288, 1991. ,
Fault-tolerant robot gathering problems on graphs with arbitrary appearing times, 31th IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp.493-502, 2017. ,
Wait-free solvability of colorless tasks in anonymous sharedmemory model, Theory of Computing Systems, pp.1-18, 2017. ,