Antti Kuusisto

Weak models of distributed computing, with connections to modal logic

This work presents a classification of weak models of distributed computing. We focus on deterministic distributed algorithms, and study models of computing that are weaker versions of the widely-studied port-numbering model. In the port-numbering model, a node of degree

Complexity of Two-Variable Dependence Logic and IF-Logic

d

Complexity and Expressivity of Uniform One-Dimensional Fragment with Equality

d receives messages through

Complexity of two-variable dependence logic and IF-logic

d

Infinite Networks, Halting and Local Algorithms.

d input ports and sends messages through