activity
20092026
most citedDistributed Computing in the Asynchronous LOCAL model

2 citations · 4 across the 13 of their papers we have counts for

collaborators
Showing 2026Show all

1 paper · 1 filter

cs.DC2026

A Simple Construction of Locally Checkable Problems Filling the LOCAL Complexity Gaps in Graphs with Arbitrary Large Degrees

Filippo Casagrande, Pierre Fraigniaud, Benjamin Jauregui +1

We show that the complexity gaps in the round complexities of locally checkable labeling (LCL) problems are not due to the fact that solutions to LCL problems must be locally check…