Local problems in trees across a wide range of distributed models

Anubhav Dhar, Eli Kujawa, Henrik Lievonen +4

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 algori…