Ismaël Jecker

According to our database, Ismaël Jecker authored at least 28 papers between 2015 and 2025.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2025

History-Deterministic Parikh Automata.

Enzo Erlich, Mario Grobler, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

ACM Trans. Comput. Log., July, 2025

Approximate Problems for Finite Transducers.

Emmanuel Filiot, Ismaël Jecker, Khushraj Madnani, Saina Sunny

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Reachability in 3-VASS Is Elementary.

Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Lukasz Orlikowski

Proceedings of the 52nd International Colloquium on Automata, Languages, and Programming, 2025

Approximation Bounds for SLACK on Identical Parallel Machines.

Louis-Claude Canon, Anthony Dugois, Pierre-Cyrille Héam, Ismaël Jecker

Proceedings of the Euro-Par 2025: Parallel Processing, 2025

2024

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.

Ismaël Jecker, Filip Mazowiecki, David Purser

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Finite-valued Streaming String Transducers.

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Anca Muscholl, Gabriele Puppis, Sarah Winter

Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

2023

A Regular and Complete Notion of Delay for Streaming String Transducers.

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter

Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

New Lower Bounds for Reachability in Vector Addition Systems.

Wojciech Czerwinski, Ismaël Jecker, Slawomir Lasota, Jérôme Leroux, Lukasz Orlikowski

Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

History-Deterministic Parikh Automata.

Enzo Erlich, Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 34th International Conference on Concurrency Theory, 2023

Bidding Graph Games with Partially-Observable Budgets.

Guy Avni, Ismaël Jecker, Dorde Zikelic

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Operational complexity and pumping lemmas.

Jürgen Dassow, Ismaël Jecker

Acta Informatica, 2022

Parikh Automata over Infinite Words.

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

Complexity of Spatial Games.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda

Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021

A Ramsey Theorem for Finite Monoids.

Ismaël Jecker

Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Infinite-Duration All-Pay Bidding Games.

Guy Avni, Ismaël Jecker, Dorde Zikelic

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.

Shibashis Guha, Ismaël Jecker, Karoliina Lehtinen, Martin Zimmermann

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.

Emmanuel Arrighi, Henning Fernau, Stefan Hoffmann, Markus Holzer, Ismaël Jecker, Mateus de Oliveira Oliveira, Petra Wolf

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Decomposing Permutation Automata.

Ismaël Jecker, Nicolas Mazzocchi, Petra Wolf

Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020

Unary Prime Languages.

Ismaël Jecker, Orna Kupferman, Nicolas Mazzocchi

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Simplified Game of Life: Algorithms and Complexity.

Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Ismaël Jecker, Jakub Svoboda

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018

The Complexity of Transducer Synthesis from Multi-Sequential Specifications.

Léo Exibard, Emmanuel Filiot, Ismaël Jecker

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Beyond Admissibility: Dominance Between Chains of Strategies.

Nicolas Basset, Ismaël Jecker, Arno Pauly, Jean-François Raskin, Marie van den Bogaard

Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017

On delay and regret determinization of max-plus automata.

Emmanuel Filiot, Ismaël Jecker, Nathan Lhote, Guillermo A. Pérez, Jean-François Raskin

Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On Reversible Transducers.

Luc Dartois, Paulin Fournier, Ismaël Jecker, Nathan Lhote

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Degree of Sequentiality of Weighted Automata.

Laure Daviaud, Ismaël Jecker, Pierre-Alain Reynier, Didier Villevalois

Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016

On Equivalence and Uniformisation Problems for Finite Transducers.

Emmanuel Filiot, Ismaël Jecker, Christof Löding, Sarah Winter

Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

Aperiodic String Transducers.

Luc Dartois, Ismaël Jecker, Pierre-Alain Reynier

Proceedings of the Developments in Language Theory - 20th International Conference, 2016

2015

Multi-sequential Word Relations.

Ismaël Jecker, Emmanuel Filiot

Proceedings of the Developments in Language Theory - 19th International Conference, 2015