12 citations · 29 across the 11 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.CC2010
Adding a referee to an interconnection network: What can(not) be computed in one round
Florent Becker, Martín Matamala, Nicolas Nisse +3
In this paper we ask which properties of a distributed network can be computed from a little amount of local information provided by its nodes. The distributed model we consider is…
cs.DS2010★ 2 cited
Complexity of Splits Reconstruction for Low-Degree Trees
Serge Gaspers, Mathieu Liedloff, Maya Stein +1
Given a vertex-weighted tree T, the split of an edge xy in T is min{s_x(xy), s_y(xy)} where s_u(uv) is the sum of all weights of vertices that are closer to u than to v in T. Given…