Edon Kelmendi

According to our database, Edon Kelmendi authored at least 19 papers between 2014 and 2024.

Collaborative distances:

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

2024

Multiple Reachability in Linear Dynamical Systems.

Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell

CoRR, 2024

2023

Submixing and shift-invariant stochastic games.

Hugo Gimbert, Edon Kelmendi

Int. J. Game Theory, December, 2023

Computing the Density of the Positivity Set for Linear Recurrence Sequences.

Edon Kelmendi

Log. Methods Comput. Sci., 2023

The Power of Positivity.

Toghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine, James Worrell

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

Reachability in Injective Piecewise Affine Maps.

Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine

Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023

2022

Value iteration for simple stochastic games: Stopping criterion and learning algorithm.

Julia Eisentraut, Edon Kelmendi, Jan Kretínský, Maximilian Weininger

Inf. Comput., 2022

What's Decidable About Discrete Linear Dynamical Systems?

Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell

Proceedings of the Principles of Systems Design, 2022

2021

Deciding ω-regular properties on linear recurrence sequences.

Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell

Proc. ACM Program. Lang., 2021

2020

Extensions of ω-Regular Languages.

Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche

Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

Invariants for Continuous Linear Dynamical Systems.

Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell

Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019

MSO+nabla is undecidable.

Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak

CoRR, 2019

MSO+∇ is undecidable.

Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak

Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

2018

Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm.

Edon Kelmendi, Julia Krämer, Jan Kretínský, Maximilian Weininger

Proceedings of the Computer Aided Verification - 30th International Conference, 2018

2017

Stamina: Stabilisation Monoids in Automata Theory.

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg

Proceedings of the Implementation and Application of Automata, 2017

Emptiness of Zero Automata Is Decidable.

Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Two-Player Stochastic Games with Perfect and Zero Information. (Jeux Stochastiques à Deux Joueurs à Information Parfaite et Zéro).

Edon Kelmendi

PhD thesis, 2016

Deciding Maxmin Reachability in Half-Blind Stochastic Games.

Edon Kelmendi, Hugo Gimbert

Proceedings of the Algorithmic Game Theory - 9th International Symposium, 2016

2015

Deciding the value 1 problem for probabilistic leaktight automata.

Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj

Log. Methods Comput. Sci., 2015

2014

Two-Player Perfect-Information Shift-Invariant Submixing Stochastic Games Are Half-Positional.

Hugo Gimbert, Edon Kelmendi

CoRR, 2014