Ioannis Kokkinis

According to our database, Ioannis Kokkinis authored at least 10 papers between 2015 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2021

The Dynamic Complexity of Acyclic Hypergraph Homomorphisms.

Nils Vortmeier, Ioannis Kokkinis

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2021

2020

Probabilistic justification logic.

Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer

J. Log. Comput., 2020

Dynamic Complexity Meets Parameterised Algorithms.

Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis

Proceedings of the 28th EACSL Annual Conference on Computer Science Logic, 2020

2019

Reachability of Five Gossip Protocols.

Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer

Proceedings of the Reachability Problems - 13th International Conference, 2019

2018

The complexity of satisfiability in non-iterated and iterated probabilistic logics.

Ioannis Kokkinis

Ann. Math. Artif. Intell., 2018

2017

Reachability and Expectation in Gossiping.

Hans van Ditmarsch, Ioannis Kokkinis, Anders Stockmarr

Proceedings of the PRIMA 2017: Principles and Practice of Multi-Agent Systems - 20th International Conference, Nice, France, October 30, 2017

The Expected Duration of Sequential Gossiping.

Hans van Ditmarsch, Ioannis Kokkinis

Proceedings of the Multi-Agent Systems and Agreement Technologies, 2017

2016

The Complexity of Non-Iterated Probabilistic Justification Logic.

Ioannis Kokkinis

Proceedings of the Foundations of Information and Knowledge Systems, 2016

2015

First steps towards probabilistic justification logic.

Ioannis Kokkinis, Petar Maksimovic, Zoran Ognjanovic, Thomas Studer

Log. J. IGPL, 2015

On the complexity of probabilistic justification logic.

Ioannis Kokkinis

CoRR, 2015