31 citations · 54 across the 4 of their papers we have counts for
5 papers
Regular Representations of Uniform TC^0
Lauri Hella, Juha Kontinen, Kerkko Luosto
The circuit complexity class DLOGTIME-uniform AC^0 is known to be a modest subclass of DLOGTIME-uniform TC^0. The weakness of AC^0 is caused by the fact that AC^0 is not closed und…
Dimension in team semantics
Lauri Hella, Kerkko Luosto, Jouko Väänänen
We introduce three measures of complexity for families of sets. Each of the three measures, that we call dimensions, is defined in terms of the minimal number of convex subfamilies…
The Expressive Power of Modal Dependence Logic
Lauri Hella, Kerkko Luosto, Katsuhiko Sano +1
We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulatio…
On logics extended with embedding-closed quantifiers
Jevgeni Haigora, Kerkko Luosto
We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures…
Weak Models of Distributed Computing, with Connections to Modal Logic
Lauri Hella, Matti Järvisalo, Antti Kuusisto +5
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 version…