default search action
Ismaël Jecker
Person information
- affiliation: University of Warsaw, Faculty of Mathematics, Informatics and Mechanics, Poland
- affiliation: Institute of Science and Technology Austria, Klosterneuburg, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. Log. Methods Comput. Sci. 20(1) (2024) - [c23]Emmanuel Filiot
Finite-valued Streaming String Transducers. LICS 2024: 33:1-33:14 - [c22]Ismaël Jecker
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. LICS 2024: 46:1-46:13 - [i19]Emmanuel Filiot, Ismaël Jecker, Gabriele Puppis
Finite-valued Streaming String Transducers. CoRR abs/2405.08171 (2024) - 2023
- [c21]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Bidding Graph Games with Partially-Observable Budgets. AAAI 2023: 5464-5471 - [c20]Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
History-Deterministic Parikh Automata. CONCUR 2023: 31:1-31:16 - [c19]Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. FSTTCS 2023: 35:1-35:22 - [c18]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. STACS 2023: 32:1-32:16 - [i18]Ismaël Jecker, Filip Mazowiecki, David Purser:
Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata. CoRR abs/2310.02204 (2023) - [i17]Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski:
New Lower Bounds for Reachability in Vector Addition Systems. CoRR abs/2310.09008 (2023) - 2022
- [j3]Jürgen Dassow
Operational complexity and pumping lemmas. Acta Informatica 59(4): 337-355 (2022) - [c17]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
Complexity of Spatial Games. FSTTCS 2022: 11:1-11:14 - [c16]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
Parikh Automata over Infinite Words. FSTTCS 2022: 40:1-40:20 - [i16]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
A Regular and Complete Notion of Delay for Streaming String Transducers. CoRR abs/2205.04287 (2022) - [i15]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
Parikh Automata over Infinite Words. CoRR abs/2207.07694 (2022) - [i14]Enzo Erlich, Mario Grobler, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
History-deterministic Parikh Automata. CoRR abs/2209.07745 (2022) - [i13]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Bidding Graph Games with Partially-Observable Budgets. CoRR abs/2211.13626 (2022) - 2021
- [c15]Ismaël Jecker, Nicolas Mazzocchi
Decomposing Permutation Automata. CONCUR 2021: 18:1-18:19 - [c14]Emmanuel Arrighi, Henning Fernau
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. FSTTCS 2021: 34:1-34:15 - [c13]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. MFCS 2021: 53:1-53:20 - [c12]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. SODA 2021: 617-636 - [c11]Ismaël Jecker:
A Ramsey Theorem for Finite Monoids. STACS 2021: 44:1-44:13 - [i12]Ismaël Jecker:
A Ramsey Theorem for Finite Monoids. CoRR abs/2101.05895 (2021) - [i11]Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct. CoRR abs/2105.02611 (2021) - [i10]Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf:
Decomposing Permutation Automata. CoRR abs/2107.04683 (2021) - [i9]Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf:
On the Complexity of Intersection Non-emptiness for Star-Free Language Classes. CoRR abs/2110.01279 (2021) - 2020
- [c10]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda
Simplified Game of Life: Algorithms and Complexity. MFCS 2020: 22:1-22:13 - [c9]Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi
Unary Prime Languages. MFCS 2020: 51:1-51:12 - [i8]Guy Avni, Ismaël Jecker, Dorde Zikelic:
Infinite-Duration All-Pay Bidding Games. CoRR abs/2005.06636 (2020)
2010 – 2019
- 2019
- [i7]Léo Exibard, Emmanuel Filiot, Ismaël Jecker:
The Complexity of Transducer Synthesis from Multi-Sequential Specifications. CoRR abs/1905.03560 (2019) - 2018
- [j2]Ismaël Jecker, Emmanuel Filiot
Multi-Sequential Word Relations. Int. J. Found. Comput. Sci. 29(2): 271-296 (2018) - [j1]Luc Dartois
Aperiodic String Transducers. Int. J. Found. Comput. Sci. 29(5): 801-824 (2018) - [c8]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond Admissibility: Dominance Between Chains of Strategies. CSL 2018: 10:1-10:22 - [c7]Léo Exibard, Emmanuel Filiot
The Complexity of Transducer Synthesis from Multi-Sequential Specifications. MFCS 2018: 46:1-46:16 - [i6]Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard:
Beyond admissibility: Dominance between chains of strategies. CoRR abs/1805.11608 (2018) - 2017
- [c6]Laure Daviaud
Degree of Sequentiality of Weighted Automata. FoSSaCS 2017: 215-230 - [c5]Luc Dartois
On Reversible Transducers. ICALP 2017: 113:1-113:12 - [c4]Emmanuel Filiot
On delay and regret determinization of max-plus automata. LICS 2017: 1-12 - [i5]Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin:
On Delay and Regret Determinization of Max-Plus Automata. CoRR abs/1701.02903 (2017) - [i4]Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois:
Degree of sequentiality of weighted automata. CoRR abs/1701.04632 (2017) - [i3]Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote:
On Reversible Transducers. CoRR abs/1702.07157 (2017) - 2016
- [c3]Luc Dartois
Aperiodic String Transducers. DLT 2016: 125-137 - [c2]Emmanuel Filiot
On Equivalence and Uniformisation Problems for Finite Transducers. ICALP 2016: 125:1-125:14 - [i2]Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter:
On Equivalence and Uniformisation Problems for Finite Transducers. CoRR abs/1602.08565 (2016) - 2015
- [c1]Ismaël Jecker, Emmanuel Filiot
Multi-sequential Word Relations. DLT 2015: 288-299 - [i1]Ismaël Jecker, Emmanuel Filiot:
Multi-Sequential Word Relations. CoRR abs/1504.03864 (2015)
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-10-07 02:39 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: