Deciding the value 1 problem for probabilistic leaktight automata N Fijalkow, H Gimbert, E Kelmendi, Y Oualhadj Logical Methods in Computer Science 11, 2015 | 52 | 2015 |

Value iteration for simple stochastic games: Stopping criterion and learning algorithm E Kelmendi, J Krämer, J Křetínský, M Weininger International conference on computer aided verification, 623-642, 2018 | 35 | 2018 |

Deciding ω-regular properties on linear recurrence sequences S Almagor, T Karimov, E Kelmendi, J Ouaknine, J Worrell Proceedings of the ACM on Programming Languages 5 (POPL), 1-24, 2021 | 23 | 2021 |

Two-player perfect-information shift-invariant submixing stochastic games are half-positional H Gimbert, E Kelmendi arXiv preprint arXiv:1401.6575, 2014 | 17 | 2014 |

Value iteration for simple stochastic games: Stopping criterion and learning algorithm J Eisentraut, E Kelmendi, J Křetínský, M Weininger Information and Computation 285, 104886, 2022 | 11 | 2022 |

What’s decidable about discrete linear dynamical systems? T Karimov, E Kelmendi, J Ouaknine, J Worrell Principles of Systems Design: Essays Dedicated to Thomas A. Henzinger on the …, 2022 | 9 | 2022 |

The power of positivity T Karimov, E Kelmendi, J Nieuwveld, J Ouaknine, J Worrell 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2023 | 8 | 2023 |

Emptiness of zero automata is decidable M Bojańczyk, H Gimbert, E Kelmendi arXiv preprint arXiv:1702.06858, 2017 | 8 | 2017 |

Submixing and shift-invariant stochastic games H Gimbert, E Kelmendi International Journal of Game Theory 52 (4), 1179-1214, 2023 | 7 | 2023 |

Invariants for continuous linear dynamical systems S Almagor, E Kelmendi, J Ouaknine, J Worrell arXiv preprint arXiv:2004.11661, 2020 | 6 | 2020 |

MSO+∇ is undecidable M Bojańczyk, E Kelmendi, M Skrzypczak 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-13, 2019 | 4 | 2019 |

Extensions of ω-regular languages M Bojańczyk, E Kelmendi, R Stefański, G Zetzsche Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer …, 2020 | 2 | 2020 |

Reachability in Injective Piecewise Affine Maps F Ghahremani, E Kelmendi, J Ouaknine 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-11, 2023 | 1 | 2023 |

Computing the density of the positivity set for linear recurrence sequences E Kelmendi Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer …, 2022 | 1 | 2022 |

MSO+ nabla is undecidable M Bojańczyk, E Kelmendi, M Skrzypczak arXiv preprint arXiv:1901.06900, 2019 | 1 | 2019 |

Two-Player Stochastic Games with Perfect and Zero Information E Kelmendi Université de Bordeaux, 2016 | 1 | 2016 |

Multiple Reachability in Linear Dynamical Systems T Karimov, E Kelmendi, J Ouaknine, J Worrell arXiv preprint arXiv:2403.06515, 2024 | | 2024 |

Deciding 𝜔-Regular Properties on Linear Recurrence Sequences E KELMENDI, J OUAKNINE, J WORRELL | | 2021 |

Invariants for continuous linear dynamical systems E Kelmendi, J Ouaknine, J Worrell, S Almagor Schloss Dagstuhl, 2020 | | 2020 |

Stamina: Stabilisation Monoids in Automata Theory N Fijalkow, H Gimbert, E Kelmendi, D Kuperberg Implementation and Application of Automata: 22nd International Conference …, 2017 | | 2017 |