Nathanaël Fijalkow

128 papers A* 13A 5B 10C 3Misc 1Journal 77Unranked 17

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	A scalable anytime algorithm for learning fragments of linear temporal logic. Formal Methods Syst. Des. Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
2026	J	`jnl`	Computing the Reachability Value of Posterior-Deterministic POMDPs. CoRR Nathanaël Fijalkow, Arka Ghosh, Roman Kniazev, Guillermo A. Pérez, Pierre Vandenhove
2026	—	`conf`	LTL TACAS (1) Gabriel Bathie, Nathanaël Fijalkow, Théo Matricon, Baptiste Mouillon, Pierre Vandenhove
2025	J	`jnl`	An Explainable Diagnostic Framework for Neurodegenerative Dementias via Reinforcement-Optimized LLM Reasoning. CoRR Andrew Zamai, Nathanaël Fijalkow, Boris Mansencal, Laurent Simon, Eloi Navet, Pierrick Coupé
2025	A*	`conf`	Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis. AAAI Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
2025	J	`jnl`	GPU accelerated program synthesis: Enumerate semantics, not syntax! CoRR Martin Berger, Nathanaël Fijalkow, Mojtaba Valizadeh
2025	J	`jnl`	LTL CoRR Gabriel Bathie, Nathanaël Fijalkow, Théo Matricon, Baptiste Mouillon, Pierre Vandenhove
2025	J	`jnl`	On the Monniaux Problem in Abstract Interpretation. J. ACM Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2025	A*	`conf`	Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. AAAI Marius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Pérez, Pierre Vandenhove
2025	A*	`conf`	The Trichotomy of Regular Property Testing. ICALP Gabriel Bathie, Nathanaël Fijalkow, Corto Mascle
2025	J	`jnl`	The Trichotomy of Regular Property Testing. CoRR Gabriel Bathie, Nathanaël Fijalkow, Corto Mascle
2024	J	`jnl`	EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis. CoRR Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde
2024	J	`jnl`	From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. TheoretiCS Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen
2024	—	`conf`	LTL Learning on GPUs. CAV (3) Mojtaba Valizadeh, Nathanaël Fijalkow, Martin Berger
2024	J	`jnl`	LTL learning on GPUs. CoRR Mojtaba Valizadeh, Nathanaël Fijalkow, Martin Berger
2024	J	`jnl`	Playing Safe, Ten Years Later. Log. Methods Comput. Sci. Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
2024	J	`jnl`	Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. CoRR Marius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Pérez, Pierre Vandenhove
2024	J	`jnl`	Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. J. Open Source Softw. Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
2024	J	`jnl`	Stochastic Games (Dagstuhl Seminar 24231). Dagstuhl Reports Nathanaël Fijalkow, Jan Kretínský, Ann Nowé, Gabriel Bathie
2024	—	`conf`	Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. VMCAI (2) Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider, Guillermo A. Pérez
2024	J	`jnl`	Theoretical foundations for programmatic reinforcement learning. CoRR Guruprerana Shabadi, Nathanaël Fijalkow, Théo Matricon
2023	J	`jnl`	From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen
2023	J	`jnl`	Games on Graphs. CoRR 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
2023	A*	`conf`	How to Play Optimally for Regular Objectives? ICALP Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove
2023	J	`jnl`	Learning temporal formulas from examples is hard. CoRR Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde
2023	J	`jnl`	Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. CoRR Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider, Guillermo A. Pérez
2023	J	`jnl`	The Futures of Reactive Synthesis (Dagstuhl Seminar 23391). Dagstuhl Reports Nathanaël Fijalkow, Bernd Finkbeiner, Guillermo A. Pérez, Elizabeth Polgreen, Rémi Morvan
2023	—	`conf`	WikiCoder: Learning to Write Knowledge-Powered Code. SPIN Théo Matricon, Nathanaël Fijalkow, Gaëtan Margueritte
2023	J	`jnl`	WikiCoder: Learning to Write Knowledge-Powered Code. CoRR Théo Matricon, Nathanaël Fijalkow, Gaëtan Margueritte
2022	J	`jnl`	A robust class of linear recurrence sequences. Inf. Comput. Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
2022	J	`jnl`	DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search. J. Open Source Softw. Théo Matricon, Nathanaël Fijalkow, Guillaume Lagarde, Kevin Ellis
2022	J	`jnl`	How to Play Optimally for Regular Objectives? CoRR Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove
2022	J	`jnl`	Playing Safe, Ten Years Later. CoRR Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
2022	J	`jnl`	Probabilistic Automata of Bounded Ambiguity. CoRR Nathanaël Fijalkow, Cristian Riveros, James Worrell
2022	J	`jnl`	Probabilistic automata of bounded ambiguity. Inf. Comput. Nathanaël Fijalkow, Cristian Riveros, James Worrell
2022	A*	`conf`	Public and Private Affairs in Strategic Reasoning. KR Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi
2022	—	`conf`	Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. TACAS (1) Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
2022	A*	`conf`	Scaling Neural Program Synthesis with Distribution-Based Search. AAAI Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta
2022	—	`book`	The Game of Synthesis. Nathanaël Fijalkow
2022	J	`jnl`	The Theory of Universal Graphs for Infinite Duration Games. Log. Methods Comput. Sci. Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2021	J	`jnl`	Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
2021	J	`jnl`	Controlling a random population. Log. Methods Comput. Sci. Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2021	J	`jnl`	Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2021	—	`conf`	New Algorithms for Combinations of Objectives using Separating Automata. GandALF Ashwani Anand, Nathanaël Fijalkow, Aliénor Goubault-Larrecq, Jérôme Leroux, Pierre Ohlmann
2021	A*	`conf`	Optimal Transformations of Games and Automata Using Muller Conditions. ICALP Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow
2021	J	`jnl`	Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic. CoRR Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider
2021	J	`jnl`	Scaling Neural Program Synthesis with Distribution-based Search. CoRR Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta
2021	A	`conf`	Statistical Comparison of Algorithm Performance Through Instance Selection. CP Théo Matricon, Marie Anastacio, Nathanaël Fijalkow, Laurent Simon, Holger H. Hoos
2021	J	`jnl`	The Complexity of Learning Linear Temporal Formulas from Examples. CoRR Nathanaël Fijalkow, Guillaume Lagarde
2021	J	`jnl`	The Theory of Universal Graphs for Infinite Duration Games. CoRR Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2021	—	`conf`	The complexity of learning linear temporal formulas from examples. ICGI Nathanaël Fijalkow, Guillaume Lagarde
2020	B	`conf`	A Robust Class of Linear Recurrence Sequences. CSL Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
2020	J	`jnl`	Alternating Tree Automata with Qualitative Semantics. CoRR Raphaël Berthon, Nathanaël Fijalkow, Emmanuel Filiot, Shibashis Guha, Bastien Maubert, Aniello Murano, Laureline Pinault, Sophie Pinchinat, Sasha Rubin, Olivier Serre
2020	A*	`conf`	Assume-Guarantee Synthesis for Prompt Linear Temporal Logic. IJCAI Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Moshe Y. Vardi
2020	J	`jnl`	Consistent Unsupervised Estimators for Anchored PCFGs. Trans. Assoc. Comput. Linguistics Alexander Clark, Nathanaël Fijalkow
2020	B	`conf`	Controlling a Random Population. FoSSaCS Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2020	A	`conf`	Data Generation for Neural Programming by Example. AISTATS Judith Clymo, Adrià Gascón, Brooks Paige, Nathanaël Fijalkow, Haik Manukian
2020	A	`conf`	Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2020	J	`jnl`	Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. J. Log. Comput. Nathanaël Fijalkow
2020	J	`jnl`	Optimal transformations of Muller conditions. CoRR Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow
2020	—	`conf`	The Theory of Universal Graphs for Games: Past and Future. CMCS Nathanaël Fijalkow
2020	J	`jnl`	Trace Refinement in Labelled Markov Decision Processes. Log. Methods Comput. Sci. Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
2020	B	`conf`	Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2019	J	`jnl`	A Robust Class of Linear Recurrence Sequences. CoRR Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki
2019	J	`jnl`	Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019	J	`jnl`	Controlling a random population. CoRR Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann
2019	J	`jnl`	Data Generation for Neural Programming by Example. CoRR Judith Clymo, Haik Manukian, Nathanaël Fijalkow, Adrià Gascón, Brooks Paige
2019	J	`jnl`	Expressiveness of probabilistic modal logics: A gradual approach. Inf. Comput. Florence Clerc, Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden
2019	J	`jnl`	Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. CoRR Nathanaël Fijalkow
2019	B	`conf`	On the Monniaux Problem in Abstract Interpretation. SAS Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019	J	`jnl`	On the Monniaux Problem in Abstract Interpretation. CoRR Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2019	—	`conf`	On the decidability of reachability in linear time-invariant systems. HSCC Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2019	B	`conf`	Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS Thomas Colcombet, Nathanaël Fijalkow
2019	A*	`conf`	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2019	J	`jnl`	Verification of Neural Networks: Specifying Global Robustness using Generative Models. CoRR Nathanaël Fijalkow, Mohit Kumar Gupta
2018	J	`jnl`	An Optimal Value Iteration Algorithm for Parity Games. CoRR Nathanaël Fijalkow
2018	J	`jnl`	Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre
2018	J	`jnl`	On the Decidability of Reachability in Linear Time-Invariant Systems. CoRR Nathanaël Fijalkow, Joël Ouaknine, Amaury Pouly, João Sousa Pinto, James Worrell
2018	J	`jnl`	Parity games and universal graphs. CoRR Thomas Colcombet, Nathanaël Fijalkow
2018	B	`conf`	Quantifying Bounds in Strategy Logic. CSL Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin
2018	A*	`conf`	The State Complexity of Alternating Automata. LICS Nathanaël Fijalkow
2018	J	`jnl`	The complexity of mean payoff games using universal graphs. CoRR Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann
2018	J	`jnl`	Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann
2018	C	`conf`	Timed Comparisons of Semi-Markov Processes. LATA Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim G. Larsen, Radu Mardare
2018	J	`jnl`	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. CoRR Wojciech Czerwinski, Laure Daviaud, Nathanaël Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys
2017	A*	`conf`	Expressiveness of Probabilistic Modal Logics, Revisited. ICALP Nathanaël Fijalkow, Bartek Klin, Prakash Panangaden
2017	J	`jnl`	Monadic Second-Order Logic with Arbitrary Monadic Predicates. CoRR Nathanaël Fijalkow, Charles Paperman
2017	J	`jnl`	Monadic Second-Order Logic with Arbitrary Monadic Predicates. ACM Trans. Comput. Log. Nathanaël Fijalkow, Charles Paperman
2017	B	`conf`	Probabilistic Automata of Bounded Ambiguity. CONCUR Nathanaël Fijalkow, Cristian Riveros, James Worrell
2017	J	`jnl`	Profinite Techniques for Probabilistic Automata. Bull. EATCS Nathanaël Fijalkow
2017	J	`jnl`	Profinite techniques for probabilistic automata and the Markov Monoid algorithm. Theor. Comput. Sci. Nathanaël Fijalkow
2017	A	`conf`	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2017	J	`jnl`	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
2017	C	`conf`	Stamina: Stabilisation Monoids in Automata Theory. CIAA Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Denis Kuperberg
2017	J	`jnl`	Timed Comparisons of Semi-Markov Processes. CoRR Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen, Radu Mardare
2017	J	`jnl`	Trading Bounds for Memory in Games with Counters. CoRR Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
2017	J	`jnl`	Two Recursively Inseparable Problems for Probabilistic Automata. CoRR Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
2017	J	`jnl`	Undecidability results for probabilistic automata. ACM SIGLOG News Nathanaël Fijalkow
2016	A	`conf`	Characterisation of an Algebraic Algorithm for Probabilistic Automata. STACS Nathanaël Fijalkow
2016	J	`jnl`	Lower Bounds for Alternating Online Space Complexity. CoRR Nathanaël Fijalkow
2016	J	`jnl`	Lower Bounds for Alternating Online Space Complexity. Electron. Colloquium Comput. Complex. Nathanaël Fijalkow
2016	A*	`conf`	The Bridge Between Regular Cost Functions and Omega-Regular Languages. ICALP Thomas Colcombet, Nathanaël Fijalkow
2016	Misc	`conf`	The Online Space Complexity of Probabilistic Languages. LFCS Nathanaël Fijalkow
2016	B	`conf`	Trace Refinement in Labelled Markov Decision Processes. FoSSaCS Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
2015	—	`—`	Counting and Randomising in Automata Theory. (Compteurs et Aléas en Théorie des Automates). Nathanaël Fijalkow
2015	J	`jnl`	Deciding the value 1 problem for probabilistic leaktight automata. Log. Methods Comput. Sci. Nathanaël Fijalkow, Hugo Gimbert, Edon Kelmendi, Youssouf Oualhadj
2015	—	`conf`	Irregular Behaviours for Probabilistic Automata. RP Nathanaël Fijalkow, Michal Skrzypczak
2015	J	`jnl`	Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm. CoRR Nathanaël Fijalkow
2015	J	`jnl`	Trace Refinement in Labelled Markov Decision Processes. CoRR Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi
2015	—	`conf`	Trading Bounds for Memory in Games with Counters. ICALP (2) Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
2014	B	`conf`	ACME: Automata with Counters, Monoids and Equivalence. ATVA Nathanaël Fijalkow, Denis Kuperberg
2014	—	`conf`	Monadic Second-Order Logic with Arbitrary Monadic Predicates. MFCS (1) Nathanaël Fijalkow, Charles Paperman
2014	J	`jnl`	Parity and Streett Games with Costs Log. Methods Comput. Sci. Nathanaël Fijalkow, Martin Zimmermann
2014	—	`conf`	Playing Safe. FSTTCS Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
2014	—	`conf`	Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
2014	J	`jnl`	What is known about the Value 1 Problem for Probabilistic Automata? CoRR Nathanaël Fijalkow
2013	—	`conf`	Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS Nathanaël Fijalkow, Sophie Pinchinat, Olivier Serre
2013	J	`jnl`	Infinite-state games with finitary conditions CoRR Krishnendu Chatterjee, Nathanaël Fijalkow
2013	B	`conf`	Infinite-state games with finitary conditions. CSL Krishnendu Chatterjee, Nathanaël Fijalkow
2013	J	`jnl`	Les jeux d'accessibilité généralisée. Tech. Sci. Informatiques Nathanaël Fijalkow, Florian Horn
2012	—	`conf`	Cost-Parity and Cost-Streett Games. FSTTCS Nathanaël Fijalkow, Martin Zimmermann
2012	A*	`conf`	Deciding the Value 1 Problem for Probabilistic Leaktight Automata. LICS Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2011	J	`jnl`	A Class of Probabilistic Automata with a Decidable Value 1 Problem CoRR Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2011	—	`conf`	A reduction from parity games to simple stochastic games GandALF Krishnendu Chatterjee, Nathanaël Fijalkow
2011	C	`conf`	Finitary Languages. LATA Krishnendu Chatterjee, Nathanaël Fijalkow
2011	J	`jnl`	Finitary languages CoRR Krishnendu Chatterjee, Nathanaël Fijalkow
2011	J	`jnl`	Pushing undecidability of the isolation problem for probabilistic automata CoRR Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
2010	J	`jnl`	The surprizing complexity of reachability games CoRR Nathanaël Fijalkow, Florian Horn