-
Exploring Gafni's reduction land: from $\Omega^k$ to wait-free adaptive $(2p-...
The adaptive renaming problem consists in designing an algorithm that allows $p$ processes (in a set of $n$ processes) to obtain new names despite asynchrony and... -
Linear Space Boostrap Communication Scheme
We consider a system of $n$ processes with ids not a priori known, that are drown from a large space, potentially unbounded. How can these $n$ processes communicate to... -
Generalized Symmetry Breaking Tasks
Processes in a concurrent system need to coordinate using an underlying shared memory or a message-passing system in order to solve agreement tasks such as, for... -
Allocation adaptative de registres en utilisant un nombre linéaire de registres
International audience
