Ismaël Jecker

Ismaël Jecker is a tenured Associate Professor in the Department of Computer Science at Université de Franche-Comté, affiliated with the Vesontio research team. He previously held postdoctoral positions at the Institute of Informatics, Faculty of Mathematics, Informatics and Mechanics, University of Warsaw (2021–2023), and at the Institute of Science and Technology Austria (IST Austria) in the Chatterjee group (2019–2021).

His educational background includes a PhD in Computer Science from Université libre de Bruxelles (ULB) (2014–2019), supervised by Emmanuel Filiot and Jean-François Raskin, and undergraduate studies in Mathematics at École Polytechnique Fédérale de Lausanne (EPFL).

Jecker's research focuses on theoretical computer science, particularly automata theory, formal methods, verification, transducers, weighted automata, and game semantics. His work bridges logic, computation, and algebraic structures, with applications in program verification and formal language processing. He investigates expressiveness, determinization, complexity, and equivalence problems in various automata models.

His recent publications, appearing in top venues like LICS, CONCUR, MFCS, and STACS, show a consistent trend toward understanding computational models with quantitative features—such as counting, bidding, and delays—and their algorithmic properties. Themes include reachability in vector addition systems, determinization of weighted automata, and strategic reasoning in graph games with partial observability.

• Best Paper Award, MFCS 2021 – A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct

Jecker has collaborated widely with leading researchers in formal methods, including Emmanuel Filiot, Wojciech Czerwiński, Krishnendu Chatterjee, and Christof Löding. While no formal advising or grant information is listed, his extensive publication record and collaborations suggest active mentorship and research leadership. He is a core member of the Vesontio team, which focuses on foundational aspects of computer science, including automata, logic, and verification.