First steps towards probabilistic justification logic. - Ioannis Kokkinis; Petar Maksimovic 001; Zoran Ognjanovic; Thomas Studer (Log. J. IGPL, 2015)

The Complexity of Non-Iterated Probabilistic Justification Logic. - Ioannis Kokkinis (FoIKS, 2016)

The Expected Duration of Sequential Gossiping. - Hans van Ditmarsch; Ioannis Kokkinis (EUMAS/AT, 2017)

Reachability and Expectation in Gossiping. - Hans van Ditmarsch; Ioannis Kokkinis; Anders Stockmarr (PRIMA, 2017)

The Complexity of Probabilistic Justification Logic. - Ioannis Kokkinis (CoRR, 2017)

The complexity of satisfiability in non-iterated and iterated probabilistic logics. - Ioannis Kokkinis (Ann. Math. Artif. Intell., 2018)

Reachability of Five Gossip Protocols. - Hans van Ditmarsch; Malvin Gattinger; Ioannis Kokkinis; Louwe B. Kuijer (RP, 2019)

Dynamic Complexity Meets Parameterised Algorithms. - Jonas Schmidt 001; Thomas Schwentick; Nils Vortmeier; Thomas Zeume; Ioannis Kokkinis (CSL, 2020)

Probabilistic justification logic. - Ioannis Kokkinis; Zoran Ognjanovic; Thomas Studer (J. Log. Comput., 2020)

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. - Nils Vortmeier; Ioannis Kokkinis (WG, 2021)