92 citations · 120 across the 20 of their papers we have counts for
5 papers · 1 filter
Models of Smoothing in Dynamic Networks
Uri Meir, Ami Paz, Gregory Schwartzman
Smoothed analysis is a framework suggested for mediating gaps between worst-case and average-case complexities. In a recent work, Dinitz et al.~[Distributed Computing, 2018] sugges…
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster, Janne H. Korhonen, Ami Paz +2
Consider a distributed task where the communication network is fixed but the local inputs given to the nodes of the distributed system may change over time. In this work, we explor…
The Topology of Local Computing in Networks
Pierre Fraigniaud, Ami Paz
Modeling distributed computing in a way enabling the use of formal methods is a challenge that has been approached from different angles, among which two techniques emerged at the…
Distributed Quantum Proofs for Replicated Data
Pierre Fraigniaud, François Le Gall, Harumichi Nishimura +1
The paper tackles the issue of that all copies of a large data set replicated at several nodes of a network are identical. The fact that the replicas may be loc…
Simple and Fast Distributed Computation of Betweenness Centrality
Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz
Betweenness centrality is a graph parameter that has been successfully applied to network analysis. In the context of computer networks, it was considered for various objectives, r…