17 citations · 89 across the 27 of their papers we have counts for
1 paper · 1 filter
Sotirios Kentros, Aggelos Kiayias
We present and analyze a wait-free deterministic algorithm for solving the at-most-once problem: how m shared-memory fail-prone processes perform asynchronously n jobs at most once…