activity
20072026
most citedPolynomial-Time Space-Optimal Silent Self-Stabilizing Minimum-Degree Spanning Tree Construction

5 citations · 24 across the 12 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.DS2024

What Can Be Computed Locally Revisited: First-Order Logic on Sparse Graphs in Distributed Computing

Lélia Blin, Fedor V. Fomin, Pierre Fraigniaud +5

The question of 'what can be computed locally?' lies at the heart of distributed computing in networks. As established in Naor and Stockmeyer's seminal paper (STOC 1993), this ques…