Invited paper: Full Anonymity in Read/Write and Read/Modify/Write Distributed Computing

This paper considers distributed algorithms where asynchronous processes cooperate through a shared memory in the adversarial context where both the computing entities (namely sequential processes) are anonymous and the communication medium is made up of shared registers that have no global names in the following sense: a shared register known as A by a process p can be known as Z by another process q (and this is unknown to the processes). So the crucial question is then: what can be computed in such a very weak addressing computing model? The paper is a short visit that answers this question.