Ioannis Kokkinis

15 papers B 3Misc 1Journal 8Unranked 3

Year	Rank	Type	Title / Venue / Authors
2021	B	`conf`	The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. WG Nils Vortmeier, Ioannis Kokkinis
2021	J	`jnl`	The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. CoRR Nils Vortmeier, Ioannis Kokkinis
2020	B	`conf`	Dynamic Complexity Meets Parameterised Algorithms. CSL Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
2020	J	`jnl`	Probabilistic justification logic. J. Log. Comput. Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer
2019	J	`jnl`	Dynamic Complexity Meets Parameterised Algorithms. CoRR Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis
2019	—	`conf`	Reachability of Five Gossip Protocols. RP Hans van Ditmarsch, Malvin Gattinger, Ioannis Kokkinis, Louwe B. Kuijer
2018	J	`jnl`	The complexity of satisfiability in non-iterated and iterated probabilistic logics. Ann. Math. Artif. Intell. Ioannis Kokkinis
2017	B	`conf`	Reachability and Expectation in Gossiping. PRIMA Hans van Ditmarsch, Ioannis Kokkinis, Anders Stockmarr
2017	J	`jnl`	The Complexity of Probabilistic Justification Logic. CoRR Ioannis Kokkinis
2017	J	`jnl`	The Complexity of Satisfiability in Non-Iterated and Iterated Probabilistic Logics. CoRR Ioannis Kokkinis
2017	—	`conf`	The Expected Duration of Sequential Gossiping. EUMAS/AT Hans van Ditmarsch, Ioannis Kokkinis
2016	Misc	`conf`	Probabilistic Justification Logic. LFCS Ioannis Kokkinis, Zoran Ognjanovic, Thomas Studer
2016	—	`conf`	The Complexity of Non-Iterated Probabilistic Justification Logic. FoIKS Ioannis Kokkinis
2015	J	`jnl`	First steps towards probabilistic justification logic. Log. J. IGPL Ioannis Kokkinis, Petar Maksimovic, Zoran Ognjanovic, Thomas Studer
2015	J	`jnl`	On the complexity of probabilistic justification logic. CoRR Ioannis Kokkinis

Kai Greshake, Sahar Abdelnabi, Shailesh Mishra, Christoph Endres, Thorsten Holz, Mario Fritz