default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEdon Kelmendi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i11]Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Multiple Reachability in Linear Dynamical Systems. CoRR abs/2403.06515 (2024)- 2023
- [j5]Hugo Gimbert, Edon Kelmendi
:
Submixing and shift-invariant stochastic games. Int. J. Game Theory 52(4): 1179-1214 (2023) - [j4]Edon Kelmendi:
Computing the Density of the Positivity Set for Linear Recurrence Sequences. Log. Methods Comput. Sci. 19(4) (2023) - [c11]Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine:
Reachability in Injective Piecewise Affine Maps. LICS 2023: 1-11 - [c10]Toghrul Karimov, Edon Kelmendi, Joris Nieuwveld, Joël Ouaknine, James Worrell:
The Power of Positivity. LICS 2023: 1-11 - [i10]Faraz Ghahremani, Edon Kelmendi, Joël Ouaknine:
Reachability in Injective Piecewise Affine Maps. CoRR abs/2301.09752 (2023) - 2022
- [j3]Julia Eisentraut, Edon Kelmendi, Jan Kretínský, Maximilian Weininger:
Value iteration for simple stochastic games: Stopping criterion and learning algorithm. Inf. Comput. 285(Part): 104886 (2022) - [c9]Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
What's Decidable About Discrete Linear Dynamical Systems? Principles of Systems Design 2022: 21-38 - [c8]Edon Kelmendi:
Computing the Density of the Positivity Set for Linear Recurrence Sequences. LICS 2022: 3:1-3:12 - [i9]Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
What's Decidable about Discrete Linear Dynamical Systems? CoRR abs/2206.11412 (2022) - 2021
- [j2]Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-regular properties on linear recurrence sequences. Proc. ACM Program. Lang. 5(POPL): 1-24 (2021) - 2020
- [c7]Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell:
Invariants for Continuous Linear Dynamical Systems. ICALP 2020: 107:1-107:15 - [c6]Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche:
Extensions of ω-Regular Languages. LICS 2020: 266-272 - [i8]Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche:
Extensions of ω-Regular Languages. CoRR abs/2002.09393 (2020) - [i7]Shaull Almagor, Edon Kelmendi, Joël Ouaknine, James Worrell:
Invariants for Continuous Linear Dynamical Systems. CoRR abs/2004.11661 (2020) - [i6]Shaull Almagor, Toghrul Karimov, Edon Kelmendi, Joël Ouaknine, James Worrell:
Deciding ω-Regular Properties on Linear Recurrence Sequences. CoRR abs/2010.14432 (2020)
2010 – 2019
- 2019
- [c5]Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+∇ is undecidable. LICS 2019: 1-13 - [i5]Mikolaj Bojanczyk, Edon Kelmendi, Michal Skrzypczak:
MSO+nabla is undecidable. CoRR abs/1901.06900 (2019) - 2018
- [c4]Edon Kelmendi, Julia Krämer, Jan Kretínský, Maximilian Weininger:
Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. CAV (1) 2018: 623-642 - [i4]Edon Kelmendi, Julia Krämer, Jan Kretínský, Maximilian Weininger:
Value Iteration for Simple Stochastic Games: Stopping Criterion and Learning Algorithm. CoRR abs/1804.04901 (2018) - 2017
- [c3]Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi:
Emptiness of Zero Automata Is Decidable. ICALP 2017: 106:1-106:13 - [c2]Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg:
Stamina: Stabilisation Monoids in Automata Theory. CIAA 2017: 101-112 - [i3]Mikolaj Bojanczyk, Hugo Gimbert, Edon Kelmendi:
Emptiness of zero automata is decidable. CoRR abs/1702.06858 (2017) - 2016
- [b1]Edon Kelmendi:
Two-Player Stochastic Games with Perfect and Zero Information. (Jeux Stochastiques à Deux Joueurs à Information Parfaite et Zéro). University of Bordeaux, France, 2016 - [c1]Edon Kelmendi, Hugo Gimbert:
Deciding Maxmin Reachability in Half-Blind Stochastic Games. SAGT 2016: 52-63 - [i2]Edon Kelmendi, Hugo Gimbert:
Deciding Maxmin Reachability in Half-Blind Stochastic Games. CoRR abs/1605.07753 (2016) - 2015
- [j1]Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj:
Deciding the value 1 problem for probabilistic leaktight automata. Log. Methods Comput. Sci. 11(2) (2015) - 2014
- [i1]Hugo Gimbert, Edon Kelmendi:
Two-Player Perfect-Information Shift-Invariant Submixing Stochastic Games Are Half-Positional. CoRR abs/1401.6575 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
