92 citations · 120 across the 20 of their papers we have counts for
4 papers · 1 filter
The Augmentation-Speed Tradeoff for Consistent Network Updates
Monika Henzinger, Ami Paz, Arash Pourdamghani +1
Emerging software-defined networking technologies enable more adaptive communication infrastructures, allowing for quick reactions to changes in networking requirements by exploiti…
Fine-Grained Complexity Lower Bounds for Families of Dynamic Graphs
Monika Henzinger, Ami Paz, A. R. Sricharan
A dynamic graph algorithm is a data structure that answers queries about a property of the current graph while supporting graph modifications such as edge insertions and deletions.…
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…
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…