1 citations · 1 across the 3 of their papers we have counts for
6 papers
Lower Bounds for -Set Agreement in Fault-Prone Networks
Pierre Fraigniaud, Minh Hang Nguyen, Ami Paz +2
We develop a new lower bound for k-set agreement in synchronous message-passing systems connected by an arbitrary directed communication network, where up to t processes may crash.…
A Sheaf-Theoretic Characterization of Tasks in Distributed Systems
Stephan Felber, Bernardo Hummes Flores, Hugo Rincon Galeana
We introduce a sheaf-theoretic characterization of task solvability in general distributed computing models, unifying distinct approaches to message-passing models. We establish ce…
Knowledge in multi-robot systems: an interplay of dynamics, computation and communication
Giorgio Cignarale, Stephan Felber, Eric Goubault +2
In this paper, we provide a framework integrating distributed multi-robot systems and temporal epistemic logic. We show that continuous-discrete hybrid systems are compatible with…
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…
H-Kernels by Walks
Hortensia Galeana-Sanchez, Hugo Rincon-Galeana, Ricardo Strausz
We prove that, if every cycle of is an -cycle, then has an -kernel by walks.