We connect three distinct lines of research that have recently explored extensions of the
classical LOCAL model of distributed computing: A. distributed quantum computing and non …

By prior work, we have many results related to distributed graph algorithms for problems that
can be defined with local constraints; the formal framework used in prior work is locally …

We consider locally checkable labeling LCL problems in the LOCAL model of distributed
computing. Since 2016, there has been a substantial body of work examining the possible …

The locality of a graph problem is the smallest distance T such that each node can choose
its own part of the solution based on its radius-T neighborhood. In many settings, a graph …

The node-averaged complexity of a problem captures the number of rounds nodes of a
graph have to spend on average to solve the problem in the LOCAL model. A challenging …

The locality of a graph problem is the smallest distance T such that each node can choose
its own part of the solution based on its radius-T neighborhood. In many settings, a graph …

The randomized online-LOCAL model captures a number of models of computing; it is at
least as strong as all of these models:-the classical LOCAL model of distributed graph …

Over the past decade, a long line of research has investigated the distributed complexity
landscape of locally checkable labeling (LCL) problems on bounded-degree graphs …

This text provides an introduction to distributed local algorithms--an area at the intersection
of theoretical computer science and discrete mathematics. We collect recent results in the …

We study complexity classes of local problems on regular trees from the perspective of
distributed local algorithms and descriptive combinatorics. We show that, surprisingly, some …