Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Edon Kelmendi
Observed name:
Kelmendi, Edon
Institution:
Queen Mary University of London
Observed institutions:
University of London,
Université de Bordeaux,
Queen Mary University of London,
University of Oxford,
Max Planck Institute for Software Systems,
Laboratoire Bordelais de Recherche en Informatique,
University of Warsaw,
Technical University of Munich
show all 8
ORCID:
0000-0003-3100-1500
Observed ORCID:
0000-0003-3100-1500
OpenAlex ID:
A5113126992
Deciding the Value 1 Problem for Probabilistic Leaktight Automata
2012
·
Nathanaël Fijalkow
, Hugo Gimbert
, et al.
·
Logical Methods in Computer Science
·
50
PDF
Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm
2018
·
Edon Kelmendi
, Julia Krämer
, et al.
·
Lecture notes in computer science
·
46
Value iteration for simple stochastic games: Stopping criterion and learning algorithm
2022
·
Julia Eisentraut
, Edon Kelmendi
, et al.
·
Information and Computation
·
34
PDF
Submixing and shift-invariant stochastic games
2023
·
Hugo Gimbert
, Edon Kelmendi
·
International Journal of Game Theory
·
32
PDF
Deciding ω-regular properties on linear recurrence sequences
2021
·
Shaull Almagor
, Toghrul Karimov
, et al.
·
Proceedings of the ACM on Programming Languages
·
29
PDF
What’s Decidable About Discrete Linear Dynamical Systems?
2022
·
Toghrul Karimov
, Edon Kelmendi
, et al.
·
Lecture notes in computer science
·
18
PDF
The Power of Positivity
2023
·
Toghrul Karimov
, Edon Kelmendi
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
14
Deciding the value 1 problem for probabilistic leaktight automata
2015
·
Fijalkow, Nathanaël
, Gimbert, Hugo
, et al.
·
HAL
·
13
PDF
Invariants for Continuous Linear Dynamical Systems
2020
·
Almagor, Shaull
, Kelmendi, Edon
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Emptiness of Zero Automata Is Decidable
2017
·
Bojanczyk, Mikolaj
, Gimbert, Hugo
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
7
PDF
Reachability in Injective Piecewise Affine Maps
2023
·
Faraz Ghahremani
, Edon Kelmendi
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
4
PDF
Multiple Reachability in Linear Dynamical Systems
2025
·
Toghrul Karimov
, Edon Kelmendi
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
3
PDF
Computing the Density of the Positivity Set for Linear Recurrence Sequences
2022
·
Edon Kelmendi
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
3
PDF
MSO+∇ is undecidable
2019
·
Mikolaj Bojanczyk
, Edon Kelmendi
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
3
PDF
Extensions of ω-Regular Languages
2020
·
Mikołaj Bojańczyk
, Edon Kelmendi
, et al.
·
ACM/IEEE Symposium on Logic in Computer Science (LICS)
·
2
PDF
Stamina: Stabilisation Monoids in Automata Theory
2017
·
Nathanaël Fijalkow
, Hugo Gimbert
, et al.
·
Lecture notes in computer science
·
2
PDF
Submixing and Shift-invariant Stochastic Games
2014
·
Gimbert, Hugo
, Kelmendi, Edon
·
HAL
·
2
Computing the Density of the Positivity Set for Linear Recurrence Sequences
2023
·
Edon Kelmendi
·
Logical Methods in Computer Science
·
1
PDF
Two-Player Stochastic Games with Perfect and Zero Information
2016
·
Edon Kelmendi
·
theses.fr (ABES)
·
1
PDF
Deciding Maxmin Reachability in Half-Blind Stochastic Games
2016
·
Edon Kelmendi
, Hugo Gimbert
·
Lecture notes in computer science
·
1
PDF
Note: On A Proof Of Positionality Of Mean-Payoff Stochastic Games
2014
·
Gimbert, Hugo
, Kelmendi, Edon
·
HAL
·
1
Show more works
View as search
Works count:
22
Citation count:
273
H-index:
8
I10-index:
8
Year
Topic
Type