Communication complexity of wait-free computability in dynamic networks
C Delporte-Gallet, H Fauconnier… - … Colloquium on Structural …, 2020 - Springer
We consider a wait-free dynamic network. The class of solvable tasks in this model is well-
known, and turns out to be the same in various similar message-passing and shared …
known, and turns out to be the same in various similar message-passing and shared …
A topological characterization to arbitrary resilient asynchronous complexity
In this work, we extend the topology-based framework and method for the quantification and
classification of general resilient asynchronous complexity. We present the arbitrary resilient …
classification of general resilient asynchronous complexity. We present the arbitrary resilient …
Continuous tasks and the asynchronous computability theorem
HR Galeana, S Rajsbaum… - 13th Innovations in …, 2022 - drops.dagstuhl.de
Abstract The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and
Shavit characterized distributed tasks that are wait-free solvable and uncovered deep …
Shavit characterized distributed tasks that are wait-free solvable and uncovered deep …
Algebraic topology and distributed computing
Algebraic topology has proved to be a useful tool in the study of distributed computing. In
this paper, we take a geometric realization problem that arises in distributed computing and …
this paper, we take a geometric realization problem that arises in distributed computing and …
Continuous Tasks and the Chromatic Simplicial Approximation Theorem
HR Galeana, S Rajsbaum, U Schmid - arXiv preprint arXiv:2109.01439, 2021 - arxiv.org
The celebrated 1999 Asynchronous Computability Theorem (ACT) of Herlihy and Shavit
characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep …
characterized the distributed tasks that are wait-free solvable, and thus uncovered a deep …