A General Input-Dependent Colorless Computability Theorem and Applications to Core-Dependent Adversaries

Yannis Coutouly, Emmanuel Godard

Distributed computing tasks can be presented with a triple $(\I,\Ou,Δ)$. The solvability of a colorless task on the Iterated Immediate Snapshot model (IIS) has been characterized…