4 citations · 7 across the 6 of their papers we have counts for
10 papers · 1 filter
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…
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…
Locally Solvable Tasks and the Limitations of Valency Arguments
Hagit Attiya, Armando Castañeda, Sergio Rajsbaum
An elegant strategy for proving impossibility results in distributed computing was introduced in the celebrated FLP consensus impossibility proof. This strategy is local in nature…
-Resilient -Immediate Snapshot and its Relation with Agreement Problems
Carole Delporte, Hugues Fauconnier, Sergio Rajsbaum +1
An immediate snapshot object is a high level communication object, built on top of a read/write distributed system in which all except one processes may crash. It allows a process…
Relaxed Queues and Stacks from Read/Write Operations
Armando Castañeda, Sergio Rajsbaum, Michel Raynal
Considering asynchronous shared memory systems in which any number of processes may crash, this work identifies and formally defines relaxations of queues and stacks that can be no…
A Topological Perspective on Distributed Network Algorithms
Armando Castañeda, Pierre Fraigniaud, Ami Paz +3
More than two decades ago, combinatorial topology was shown to be useful for analyzing distributed fault-tolerant algorithms in shared memory systems and in message passing systems…