Publications

Links: DBLP, Google Scholar, arXiv

2024

• Multiple Reachability in Linear Dynamical Systems (arxiv)
  Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell

2023

• Reachability in Injective Piecewise Affine Maps (arxiv) (slides)
  Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine
  Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 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 (LICS 2023)

• Submixing and Shift-Invariant Stochastic Games (arxiv) (doi)
  Hugo Gimbert, Edon Kelmendi
  International Journal of Game Theory (IJGT) 1432-1270.

2022

• Computing the Density of the Positivity Set for Linear Recurrence Sequences (arxiv) (doi) (slides)
  Edon Kelmendi
  Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2022)
  ( Distinguished paper award. Invited to the LMCS special issue for LICS. )
  

• What's Decidable About Discrete Linear Dynamical Systems? (arxiv) (doi)
  Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell
  In Principles of Systems Design. Lecture Notes in Computer Science, vol 13660.
  (Thomas Henzinger Festschrift)

• Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning (doi)
  Julia Eisentraut, Edon Kelmendi, Jan Křetínský, Maximilian Weininger
  Information and Computation, Volume 285, Part B, 104886 (Inf. Comput. 285)

2021

• Deciding \(\omega\)-Regular Properties on Linear Recurrence Sequeneces (arxiv) (doi) (slides)
  Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell
  Proceedings of the ACM on Programming Languages, Volume 5, Article No.: 48 (POPL 2021)

2020

• Invariants for Continuous Linear Dynamical Systems (arxiv) (doi)
  Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell
  Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP 2020)

• Extensions of \(\omega\)-Regular Languages (arxiv) (doi) (slides)
  Mikołaj Bojańczyk, Edon Kelmendi, Rafał Stefański, Georg Zetzsche
  Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2020)

2019

• MSO+\(\nabla\) is undecidable (arxiv) (doi) (slides)
  Mikołaj Bojańczyk, Edon Kelmendi, Michał Skrzypczak
  Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2019)

2018

• Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm (arxiv) (doi)
  Edon Kelmendi, Julia Krämer, Jan Křetínský, Maximilian Weininger
  In Computer Aided Verification. Lecture Notes in Computer Science, vol 10981 (CAV 2018)

2017

• Emptiness of Zero Automata is Decidable (arxiv) (doi)
  Mikołaj Bojańczyk, Hugo Gimbert, Edon Kelmendi
  In Proceedings of the 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)

• Stamina: Stabilisation Monoids in Automata Theory (pdf) (github) (doi)
  Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
  In Implementation and Application of Automata. Lecture Notes in Computer Science, vol 10329 (CIAA 2017)

2016

• Deciding Maxmin Reachability in Half-Blind Stochastic Games (arxiv) (doi)
  Edon Kelmendi, Hugo Gimbert
  In Symposium of Algorithmic Game Theory. Lecture Notes in Computer Science, vol 9928 (SAGT 2016)

2015

• Deciding the Value 1 Problem for Probabilistic Leaktight Automata (arxiv) (doi)
  Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj
  Logical Methods in Computer Science Volume 11, Issue 2 (LMCS)

Others

Theses

• Two-Player Stochastic Games with Perfect and Zero Information (pdf)
  Edon Kelmendi
  PhD thesis. University of Bordeaux