%0 Conference Proceedings %T A Characterization of t-Resilient Colorless Task Anonymous Solvability %+ Institut de Recherche en Informatique Fondamentale (IRIF (UMR_8243)) %+ Networks, Graphs and Algorithms (GANG) %+ Instituto de Matematicas [México] %+ Faculty of Science [Kyoto] %A Delporte-Gallet, Carole %A Fauconnier, Hugues %A Rajsbaum, Sergio %A Yanagisawa, Nayuta %< avec comité de lecture %B SIROCCO 2018 - 25th International Colloquium Structural Information and Communication Complexity %C Ma'ale HaHamisha, Israel %Y Zvi Lotker %Y Boaz Patt-Shamir %I Springer %V LNCS - Lecture Notes in Computer Science %N 11085 %8 2018-06-18 %D 2018 %R 10.1007/978-3-030-01325-7_18 %K MWMR registers %K Anonymity %K Distributed task %K Topology %Z Cognitive science/Computer scienceConference papers %X One of the central questions in distributed computability is characterizing the tasks that are solvable in a given system model. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a recent topologi-cal characterization (Yanagisawa 2017) of the colorless tasks that are solvable when any number of asynchronous processes may crash. In this paper, we consider the case where at most t asynchronous processes may crash, where 1 ≤ t < n. We prove that a colorless task is t-resilient solvable anonymously if and only if it is t-resilient solvable non-anonymously. We obtain our results through various reductions and simulations that explore how to extend techniques for non-anonymous computation to anonymous one. %G English %2 https://inria.hal.science/hal-01955837/document %2 https://inria.hal.science/hal-01955837/file/main.pdf %L hal-01955837 %U https://inria.hal.science/hal-01955837 %~ UNIV-PARIS7 %~ CNRS %~ INRIA %~ INRIA-ROCQ %~ TESTALAIN1 %~ INRIA2 %~ USPC %~ UNIV-PARIS %~ UP-SCIENCES %~ INRIA-JAPON %~ TEST4-HALCNRS %~ IRIF