2013: Definability of linear equation systems over groups and rings.
Joint work with Anuj Dawar, Erich Graedel, Bjarki Holm, and Wied Pakusa.
A full version of the CSL paper.
Logical Methods in Computer Science 9 (4:12), 2013.

Logical properties of random graphs from small addable classes.
Joint work with Anuj Dawar.
arXiv

CFI construction for tournaments.
Joint work with Anuj Dawar.
Abstract:
The CFI construction constructs a family of graphs which are not distinguished
by a formula of C^k logic. In this paper we present how this construction
can be used on tournaments.

Work in progress: Individual vs. collective thought - the "islands" experiment.
Joint work with Dorota Celińska
and Tomasz Kopczewski.