Ismaël Jecker

Université de Franche-Comté

About me

I am a tenured associate professor (Maître de Conférences) at Université de Franche-Comté and a member of the Vesontio team.

Between 2021 and 2023 I was a postdoctoral researcher supervised by Wojciech Czerwiński at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics of the University of Warsaw (MIMUW).

Between 2019 and 2021 I was a postdoctoral researcher in Chatterjee group at the Institute of Science and Technology Austria (IST Austria).

Between 2014 and 2019 I did my PhD in computer science under the supervision of Emmanuel Filiot and Jean-François Raskin in the formal methods and verification group at the Université libre de Bruxelles (ULB).
Before that, I studied mathematics at the École polytechnique fédérale de Lausanne (EPFL).

My CV (in french): Download

Presentation Slides - May 28, 2024

How hard it the reachability problem for Petri nets?

Publications

Finite-valued Streaming String Transducers (LICS 2024)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis and Sarah Winter.

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata (LICS 2024)
Ismaël Jecker, Filip Mazowiecki and David Purser.

New Lower Bounds for Reachability in Vector Addition Systems (FSTTCS 2023)
Wojciech Czerwiński, Ismaël Jecker, Jérôme Leroux, Sławomir Lasota, Łukasz Orlikowski.

History-Deterministic Parikh Automata (CONCUR 2023)
Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann:

A regular and complete notion of delay for streaming string transducers (STACS 2023)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter.

Bidding Graph Games with Partially-Observable Budgets (AAAI 2023)
Guy Avni, Ismaël Jecker, Ðorđe Žikelić.

Complexity of Spatial Games (FSTTCS 2022)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda.

Parikh Automata over Infinite Words (FSTTCS 2022)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann.

Operational complexity and pumping lemmas (Acta Informatica)
Jürgen Dassow, Ismaël Jecker.

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes (FSTTCS 2021)
Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf.

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct (MFCS 2021, best paper award)
Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann.

Decomposing Permutation Automata (CONCUR 2021)
Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf.

A Ramsey Theorem for Finite Monoids (STACS 2021)
Ismaël Jecker.

Infinite-Duration All-Pay Bidding Games (SODA 2021)
Guy Avni, Ismaël Jecker, Ðorđe Žikelić.

Simplified Game of Life: Algorithms and Complexity (MFCS 2020)
Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda.

Unary Prime Languages (MFCS 2020)
Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi.

Beyond Admissibility: Dominance Between Chains of Strategies (CSL 2018)
Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard.

The Complexity of Transducer Synthesis from Multi-Sequential Specifications (MFCS 2018)
Léo Exibard, Emmanuel Filiot, Ismaël Jecker.

Degree of Sequentiality of Weighted Automata (FoSSaCS 2017)
Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois.

On Reversible Transducers (ICALP 2017)
Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote.

On delay and regret determinization of max-plus automata (LICS 2017)
Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin.

Aperiodic String Transducers (DLT 2016)
Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier.

On Equivalence and Uniformisation Problems for Finite Transducers (ICALP 2016)
Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter.

Multi-sequential Word Relations (DLT 2015)
Ismaël Jecker, Emmanuel Filiot.

Contact

Email address: ismael [dot] jecker [at] gmail [dot] com