Dr Edon Kelmendi

Edon Kelmendi

Lecturer in Computer Science

School of Electronic Engineering and Computer Science
Queen Mary University of London
ORCID Google Scholar

Research

Dynamical Systems, Logics in CS, Game theory, Automata

Interests

I am generally interested in the theory of computation, particularly in algorithmic verification, including but not limited to algorithms for dynamical systems, logics in computer science, game theory, and automata.

Publications

solid heart iconPublications of specific relevance to the Centre for Fundamental Computer Science

2023

Relevant PublicationKelmendi E (2023). Computing the Density of the Positivity Set for Linear Recurrence Sequences. Logical Methods in Computer Science, Centre pour la Communication Scientifique Directe (CCSD) vol. Volume 19, Issue 4 
28-11-2023
Relevant PublicationKarimov T, Kelmendi E, Nieuwveld J, Ouaknine J and Worrell J (2023). The Power of Positivity. 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
29-06-2023
Relevant PublicationGhahremani F, Kelmendi E and Ouaknine J (2023). Reachability in Injective Piecewise Affine Maps. 2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
29-06-2023
Relevant PublicationGimbert H and Kelmendi E (2023). Submixing and shift-invariant stochastic games. International Journal of Game Theory, Springer Nature vol. 52 (4), 1179-1214.  
25-05-2023

2022

Relevant PublicationEisentraut J, Kelmendi E, Křetínský J and Weininger M (2022). Value iteration for simple stochastic games: Stopping criterion and learning algorithm. Information and Computation, Elsevier vol. 285 
01-05-2022