15 citations · 41 across the 6 of their papers we have counts for
3 papers · 1 filter
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries
Ami Paz, Hugo Rincon Galeana, Stefan Schmid +2
Consensus is a most fundamental task in distributed computing. This paper studies the consensus problem for a set of processes connected by a dynamic directed network, in which com…
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…
Fire!
Krisztina Fruzsa, Roman Kuznets, Ulrich Schmid
In this paper, we provide an epistemic analysis of a simple variant of the fundamental consistent broadcasting primitive for byzantine fault-tolerant asynchronous distributed syste…