Nov 6, 2017 · We present a general technique for engineering LCL problems with numerous different deterministic time complexities.

We present a general technique for engineering LCL problems with numerous different deterministic time complexities.

We present a general technique for engineering LCL problems with numerous different deterministic time complexities.

2018. New Classes of Distributed Time. Complexity. In Proceedings of 50th Annual ACM SIGACT Symposium on the Theory of Computing (STOC'18).

What about polynomial complexities with sub-diameter time/sub-linear volume? What are meaningful subclasses of LCL problems where there are gaps again? New ...

It is a simple class that contains many well known problems. Lower bounds in this model apply to less powerful models. New Classes of Distributed Time ...

LCLs on General Graphs. •There are problems with complexity卷(logn). •Anyo(loglog∗n)rounds algorithm can be converted to an. O(1)rounds algorithm (same ...

The time complexity classes for deterministic algorithms in bounded-degree graphs that are known to exist by prior work are Θ(1), Θ(log∗ n), Θ(log n), Θ(n1/k), ...

This work presents a general technique for engineering LCL problems with numerous different deterministic time complexities, including Θ(log α n) for any α ...

Here $T$ is the distributed time complexity of $\Pi$. The time complexity classes for deterministic algorithms in bounded-degree graphs that are known to exist ...