Nathanaël Fijalkow

ORCID

Publication Activity (10 Years)

Years Active: 2010-2024
Publications (10 Years): 88

Top Venues

CoRR

Log. Methods Comput. Sci.

ICALP

Electron. Colloquium Comput. Complex.

Publications

Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
Playing Safe, Ten Years Later. Log. Methods Comput. Sci. 20 (1) (2024)
Mojtaba Valizadeh, Nathanaël Fijalkow, Martin Berger
LTL learning on GPUs. CoRR (2024)
Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider, Guillermo A. Pérez
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. VMCAI (2) (2024)
Mojtaba Valizadeh, Nathanaël Fijalkow, Martin Berger
LTL Learning on GPUs. CAV (3) (2024)
Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. J. Open Source Softw. 9 (93) (2024)
Guruprerana Shabadi, Nathanaël Fijalkow, Théo Matricon
Theoretical foundations for programmatic reinforcement learning. CoRR (2024)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR (2023)
Théo Matricon, Nathanaël Fijalkow, Gaëtan Margueritte
WikiCoder: Learning to Write Knowledge-Powered Code. SPIN (2023)
Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra
Games on Graphs. CoRR (2023)
Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider, Guillermo A. Pérez
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. CoRR (2023)
Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove
How to Play Optimally for Regular Objectives? ICALP (2023)
Nathanaël Fijalkow, Bernd Finkbeiner, Guillermo A. Pérez, Elizabeth Polgreen, Rémi Morvan
The Futures of Reactive Synthesis (Dagstuhl Seminar 23391). Dagstuhl Reports 13 (9) (2023)
Théo Matricon, Nathanaël Fijalkow, Gaëtan Margueritte
WikiCoder: Learning to Write Knowledge-Powered Code. CoRR (2023)
Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde
Learning temporal formulas from examples is hard. CoRR (2023)
Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde, Kevin Ellis
DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search. J. Open Source Softw. 7 (78) (2022)
Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. 18 (3) (2022)
Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. TACAS (1) (2022)
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta
Scaling Neural Program Synthesis with Distribution-Based Search. AAAI (2022)
Nathanaël Fijalkow, Cristian Riveros, James Worrell
Probabilistic automata of bounded ambiguity. Inf. Comput. 282 (2022)
Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove
How to Play Optimally for Regular Objectives? CoRR (2022)
Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi
Public and Private Affairs in Strategic Reasoning. KR (2022)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
A robust class of linear recurrence sequences. Inf. Comput. 289 (Part) (2022)
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
Playing Safe, Ten Years Later. CoRR (2022)
Nathanaël Fijalkow, Cristian Riveros, James Worrell
Probabilistic Automata of Bounded Ambiguity. CoRR (2022)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a random population. Log. Methods Comput. Sci. 17 (4) (2021)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow
Optimal Transformations of Games and Automata Using Muller Conditions. ICALP (2021)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30 (2) (2021)
Nathanaël Fijalkow, Guillaume Lagarde
The Complexity of Learning Linear Temporal Formulas from Examples. CoRR (2021)
Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta
Scaling Neural Program Synthesis with Distribution-based Search. CoRR (2021)
Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The Theory of Universal Graphs for Infinite Duration Games. CoRR (2021)
Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, Holger H. Hoos
Statistical Comparison of Algorithm Performance Through Instance Selection. CP (2021)
Nathanaël Fijalkow, Guillaume Lagarde
The complexity of learning linear temporal formulas from examples. ICGI (2021)
Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann
New Algorithms for Combinations of Objectives using Separating Automata. GandALF (2021)
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22 (1) (2021)
Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic. CoRR (2021)
Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
Alternating Tree Automata with Qualitative Semantics. CoRR (2020)
Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
Trace Refinement in Labelled Markov Decision Processes. Log. Methods Comput. Sci. 16 (2) (2020)
Judith Clymo, Adrià Gascón, Brooks Paige, Nathanaël Fijalkow, Haik Manukian
Data Generation for Neural Programming by Example. AISTATS (2020)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
A Robust Class of Linear Recurrence Sequences. CSL (2020)
Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS (2020)
Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Moshe Y. Vardi
Assume-Guarantee Synthesis for Prompt Linear Temporal Logic. IJCAI (2020)
Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow
Optimal transformations of Muller conditions. CoRR (2020)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS (2020)
Nathanaël Fijalkow
The Theory of Universal Graphs for Games: Past and Future. CMCS (2020)
Alexander Clark, Nathanaël Fijalkow
Consistent Unsupervised Estimators for Anchored PCFGs. Trans. Assoc. Comput. Linguistics 8 (2020)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a Random Population. FoSSaCS (2020)
Nathanaël Fijalkow
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. J. Log. Comput. 30 (1) (2020)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA (2019)
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
On the decidability of reachability in linear time-invariant systems. HSCC (2019)
Judith Clymo, Haik Manukian, Nathanaël Fijalkow, Adrià Gascón, Brooks Paige
Data Generation for Neural Programming by Example. CoRR (2019)
Thomas Colcombet, Nathanaël Fijalkow
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS (2019)
Nathanaël Fijalkow
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. CoRR (2019)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63 (5) (2019)
Nathanaël Fijalkow, Mohit Kumar Gupta
Verification of Neural Networks: Specifying Global Robustness using Generative Models. CoRR (2019)
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. CoRR (2019)
Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. SAS (2019)
Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
A Robust Class of Linear Recurrence Sequences. CoRR (2019)
Florence Clerc, Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden
Expressiveness of probabilistic modal logics: A gradual approach. Inf. Comput. 267 (2019)
Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
Controlling a random population. CoRR (2019)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. 25 (2018)
Nathanaël Fijalkow
An Optimal Value Iteration Algorithm for Parity Games. CoRR (2018)
Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
The complexity of mean payoff games using universal graphs. CoRR (2018)
Nathanaël Fijalkow
The State Complexity of Alternating Automata. LICS (2018)
Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. 25 (2018)
Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin
Quantifying Bounds in Strategy Logic. CSL (2018)
Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
On the Decidability of Reachability in Linear Time-Invariant Systems. CoRR (2018)
Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR (2018)
Thomas Colcombet, Nathanaël Fijalkow
Parity games and universal graphs. CoRR (2018)
Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim G. Larsen, Radu Mardare
Timed Comparisons of Semi-Markov Processes. LATA (2018)
Nathanaël Fijalkow, Cristian Riveros, James Worrell
Probabilistic Automata of Bounded Ambiguity. CONCUR (2017)
Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen, Radu Mardare
Timed Comparisons of Semi-Markov Processes. CoRR (2017)
Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden
Expressiveness of Probabilistic Modal Logics, Revisited. ICALP (2017)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR (2017)
Nathanaël Fijalkow, Charles Paperman
Monadic Second-Order Logic with Arbitrary Monadic Predicates. CoRR (2017)
Nathanaël Fijalkow
Profinite techniques for probabilistic automata and the Markov Monoid algorithm. Theor. Comput. Sci. 680 (2017)
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
Two Recursively Inseparable Problems for Probabilistic Automata. CoRR (2017)
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
Trading Bounds for Memory in Games with Counters. CoRR (2017)
Nathanaël Fijalkow
Undecidability results for probabilistic automata. ACM SIGLOG News 4 (4) (2017)
Nathanaël Fijalkow
Profinite Techniques for Probabilistic Automata. Bull. EATCS 122 (2017)
Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
Stamina: Stabilisation Monoids in Automata Theory. CIAA (2017)
Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS (2017)
Nathanaël Fijalkow, Charles Paperman
Monadic Second-Order Logic with Arbitrary Monadic Predicates. ACM Trans. Comput. Log. 18 (3) (2017)
Nathanaël Fijalkow
Characterisation of an Algebraic Algorithm for Probabilistic Automata. STACS (2016)
Nathanaël Fijalkow
Lower Bounds for Alternating Online Space Complexity. Electron. Colloquium Comput. Complex. 23 (2016)
Nathanaël Fijalkow
The Online Space Complexity of Probabilistic Languages. LFCS (2016)
Thomas Colcombet, Nathanaël Fijalkow
The Bridge Between Regular Cost Functions and Omega-Regular Languages. ICALP (2016)
Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
Trace Refinement in Labelled Markov Decision Processes. FoSSaCS (2016)
Nathanaël Fijalkow
Lower Bounds for Alternating Online Space Complexity. CoRR (2016)
Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
Trading Bounds for Memory in Games with Counters. ICALP (2) (2015)
Nathanaël Fijalkow
Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm. CoRR (2015)
Nathanaël Fijalkow, Michal Skrzypczak
Irregular Behaviours for Probabilistic Automata. RP (2015)
Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj
Deciding the value 1 problem for probabilistic leaktight automata. Log. Methods Comput. Sci. 11 (2) (2015)
Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
Trace Refinement in Labelled Markov Decision Processes. CoRR (2015)
Nathanaël Fijalkow, Martin Zimmermann
Parity and Streett Games with Costs Log. Methods Comput. Sci. 10 (2) (2014)
Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
Playing Safe. FSTTCS (2014)
Nathanaël Fijalkow, Denis Kuperberg
ACME: Automata with Counters, Monoids and Equivalence. ATVA (2014)
Nathanaël Fijalkow
What is known about the Value 1 Problem for Probabilistic Automata? CoRR (2014)
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) (2014)
Nathanaël Fijalkow, Charles Paperman
Monadic Second-Order Logic with Arbitrary Monadic Predicates. MFCS (1) (2014)
Nathanaël Fijalkow, Florian Horn
Les jeux d'accessibilité généralisée. Tech. Sci. Informatiques 32 (9-10) (2013)

Nathanaël Fijalkow.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Nathanaël Fijalkow