4 citations · 8 across the 7 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DC2021
Continuous Tasks and the Chromatic Simplicial Approximation Theorem
Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid
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 connec…
cs.DC2021
Leader Election in Arbitrarily Connected Networks with Process Crashes and Weak Channel Reliability
Carlos López, Sergio Rajsbaum, Michel Raynal +1
A channel from a process p to a process q satisfies the ADD property if there are constants K and D, unknown to the processes, such that in any sequence of K consecutive messages s…