Ismaël Jecker

Orcid: 0000-0002-6527-4470

Affiliations:
  • University of Warsaw, Faculty of Mathematics, Informatics and Mechanics, Poland
  • Institute of Science and Technology Austria, Klosterneuburg, Austria


According to our database1, Ismaël Jecker authored at least 25 papers between 2016 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Bit of Nondeterminism Makes Pushdown Automata Expressive and Succinct.
Log. Methods Comput. Sci., 2024

Determinisation and Unambiguisation of Polynomially-Ambiguous Rational Weighted Automata.
Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 2024

Finite-valued Streaming String Transducers.
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.
Proceedings of the 40th International Symposium on Theoretical Aspects of Computer Science, 2023

New Lower Bounds for Reachability in Vector Addition Systems.
Proceedings of the 43rd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2023

History-Deterministic Parikh Automata.
Proceedings of the 34th International Conference on Concurrency Theory, 2023

Bidding Graph Games with Partially-Observable Budgets.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
History-deterministic Parikh Automata.
CoRR, 2022

Operational complexity and pumping lemmas.
Acta Informatica, 2022

Parikh Automata over Infinite Words.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

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

2021
A Ramsey Theorem for Finite Monoids.
Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science, 2021

Infinite-Duration All-Pay Bidding Games.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

On the Complexity of Intersection Non-emptiness for Star-Free Language Classes.
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021

Decomposing Permutation Automata.
Proceedings of the 32nd International Conference on Concurrency Theory, 2021

2020
Unary Prime Languages.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Simplified Game of Life: Algorithms and Complexity.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

2018
Multi-Sequential Word Relations.
Int. J. Found. Comput. Sci., 2018

Aperiodic String Transducers.
Int. J. Found. Comput. Sci., 2018

The Complexity of Transducer Synthesis from Multi-Sequential Specifications.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Beyond Admissibility: Dominance Between Chains of Strategies.
Proceedings of the 27th EACSL Annual Conference on Computer Science Logic, 2018

2017
On delay and regret determinization of max-plus automata.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017

On Reversible Transducers.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

Degree of Sequentiality of Weighted Automata.
Proceedings of the Foundations of Software Science and Computation Structures, 2017

2016
On Equivalence and Uniformisation Problems for Finite Transducers.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016


  Loading...