2 citations · 6 across the 13 of their papers we have counts for
Showing 2022 · cs.DCShow all
2 papers · 2 filters
cs.DC2022
A Speedup Theorem for Asynchronous Computation with Applications to Consensus and Approximate Agreement
Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum
We study two fundamental problems of distributed computing, consensus and approximate agreement, through a novel approach for proving lower bounds and impossibility results, that w…
cs.DC2022★ 1 cited
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…