19 citations · 110 across the 50 of their papers we have counts for
4 papers · 2 filters
Distributed Algorithms Made Secure: A Graph Theoretic Approach
Merav Parter, Eylon Yogev
In the area of distributed graph algorithms a number of network's entities with local views solve some computational task by exchanging messages with their neighbors. Quite unfortu…
Optimal Vertex Fault Tolerant Spanners (for fixed stretch)
Greg Bodwin, Michael Dinitz, Merav Parter +1
A -spanner of a graph is a sparse subgraph whose shortest path distances match those of up to a multiplicative error . In this paper we study spanners that are re…
Improved Deterministic Distributed Construction of Spanners
Ofer Grossman, Merav Parter
Graph spanners are fundamental graph structures with a wide range of applications in distributed networks. We consider a standard synchronous message passing model where in each ro…
Preserving Distances in Very Faulty Graphs
Greg Bodwin, Fabrizio Grandoni, Merav Parter +1
Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, res…