On Extending Brandt's Speedup Theorem from LOCAL to Round-Based Full-Information Models

Paul Bastide, Pierre Fraigniaud

Given any task $\Pi$, Brandt's speedup theorem (PODC 2019) provides a mechanical way to design another task~${\Pi }^{\prime }$ on the same input-set as $\Pi$ such that, for any $t\ge 1$, $\Pi$ is sol…