29 citations · 80 across the 30 of their papers we have counts for
Showing 2011 · cs.DSShow all
3 papers · 2 filters
cs.DS2011
Efficient Computation of Distance Sketches in Distributed Networks
Atish Das Sarma, Michael Dinitz, Gopal Pandurangan
Distance computation is one of the most fundamental primitives used in communication networks. The cost of effectively and accurately computing pairwise network distances can becom…
cs.DS2011
iBGP and Constrained Connectivity
Michael Dinitz, Gordon Wilfong
We initiate the theoretical study of the problem of minimizing the size of an iBGP overlay in an Autonomous System (AS) in the Internet subject to a natural notion of correctness d…
cs.DS2011★ 29 cited
Fault-Tolerant Spanners: Better and Simpler
Michael Dinitz, Robert Krauthgamer
A natural requirement of many distributed structures is fault-tolerance: after some failures, whatever remains from the structure should still be effective for whatever remains fro…