Nathanaël Fijalkow

Generating author description...

All published works

Action	Title	Year	Authors
+ PDF Chat	EcoSearch: A Constant-Delay Best-First Search Algorithm for Program Synthesis	2024	Théo Matricon Nathanaël Fijalkow Guillaume Lagarde
+ PDF Chat	On the Monniaux Problem in Abstract Interpretation	2024	Nathanaël Fijalkow Engel Lefaucheux Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell
+	Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives	2024	Marius Belly Nathanaël Fijalkow Hugo Gimbert Florian Horn Gabriel Acosta Pierre Vandenhove
+	From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism	2024	Antonio Casares Thomas Colcombet Nathanaël Fijalkow Karoliina Lehtinen
+ PDF Chat	LTL learning on GPUs	2024	Mojtaba Valizadeh Nathanaël Fijalkow Martin Berger
+ PDF Chat	Theoretical foundations for programmatic reinforcement learning	2024	Guruprerana Shabadi Nathanaël Fijalkow Théo Matricon
+	WikiCoder: Learning to Write Knowledge-Powered Code	2023	Théo Matricon Nathanaël Fijalkow Gaëtan Margueritte
+ PDF Chat	WikiCoder: Learning to Write Knowledge-Powered Code	2023	Théo Matricon Nathanaël Fijalkow Gaëtan Margueritte
+	From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism	2023	Antonio Casares Thomas Colcombet Nathanaël Fijalkow Karoliina Lehtinen
+	Games on Graphs	2023	Nathanaël Fijalkow Nathalie Bertrand Patricia Bouyer Romain Brenguier Arnaud Carayol John Fearnley Hugo Gimbert Florian Horn Rasmus Ibsen-Jensen Nicolas Markey
+	Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic	2023	Ritam Raha Rajarshi Roy Nathanaël Fijalkow Daniel Neider Guillermo A. Pérez
+	Learning temporal formulas from examples is hard	2023	Corto Mascle Nathanaël Fijalkow Guillaume Lagarde
+ PDF Chat	A robust class of linear recurrence sequences	2022	Corentin Barloy Nathanaël Fijalkow Nathan Lhote Filip Mazowiecki
+ PDF Chat	The Theory of Universal Graphs for Infinite Duration Games	2022	Thomas Colcombet Nathanaël Fijalkow Paweł Gawrychowski Pierre Ohlmann
+ PDF Chat	Scaling Neural Program Synthesis with Distribution-Based Search	2022	Nathanaël Fijalkow Guillaume Lagarde Théo Matricon Kevin Ellis Pierre Ohlmann Akarsh Nayan Potta
+	Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic	2022	Ritam Raha Rajarshi Roy Nathanaël Fijalkow Daniel Neider
+	Playing Safe, Ten Years Later	2022	Thomas Colcombet Nathanaël Fijalkow Florian Horn
+	How to Play Optimally for Regular Objectives?	2022	Patricia Bouyer Nathanaël Fijalkow Mickaël Randour Pierre Vandenhove
+ PDF Chat	Controlling a random population	2021	Thomas Colcombet Nathanaël Fijalkow Pierre Ohlmann
+	Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic.	2021	Ritam Raha Rajarshi Roy Nathanaël Fijalkow Daniel Neider
+ PDF Chat	Lower Bounds for Arithmetic Circuits via the Hankel Matrix	2021	Nathanaël Fijalkow Guillaume Lagarde Pierre Ohlmann Olivier Serre
+ PDF Chat	New Algorithms for Combinations of Objectives using Separating Automata	2021	Ashwani Anand Nathanaël Fijalkow Aliénor Goubault--Larrecq Jérôme Leroux Pierre Ohlmann
+ PDF Chat	Controlling a random population	2021	Pierre Ohlmann Nathanaël Fijalkow Thomas Colcombet
+ PDF Chat	Optimal transformations of Muller conditions	2021	Antonio Casares Thomas Colcombet Nathanaël Fijalkow
+	The Complexity of Learning Linear Temporal Formulas from Examples	2021	Nathanaël Fijalkow Guillaume Lagarde
+	Scaling Neural Program Synthesis with Distribution-based Search	2021	Nathanaël Fijalkow Guillaume Lagarde Théo Matricon Kevin Ellis Pierre Ohlmann Akarsh Nayan Potta
+	Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic	2021	Ritam Raha Rajarshi Roy Nathanaël Fijalkow Daniel Neider
+	The Theory of Universal Graphs for Infinite Duration Games	2021	Thomas Colcombet Nathanaël Fijalkow Paweł Gawrychowski Pierre Ohlmann
+ PDF Chat	Alternating Tree Automata with Qualitative Semantics	2020	Raphaël Berthon Nathanaël Fijalkow Emmanuel Filiot Shibashis Guha Bastien Maubert Aniello Murano Laureline Pinault Sophie Pinchinat Sasha Rubin Olivier Serre
+ PDF Chat	Probabilistic automata of bounded ambiguity	2020	Nathanaël Fijalkow Cristian Riveros James Worrell
+	Alternating Tree Automata with Qualitative Semantics	2020	Raphaël Berthon Nathanaël Fijalkow Emmanuel Filiot Shibashis Guha Bastien Maubert Aniello Murano Laureline Pinault Sophie Pinchinat Sasha Rubin Olivier Serre
+ PDF Chat	A Robust Class of Linear Recurrence Sequences	2020	Corentin Barloy Nathanaël Fijalkow Nathan Lhote Filip Mazowiecki
+ PDF Chat	Lower bounds for the state complexity of probabilistic languages and the language of prime numbers	2020	Nathanaël Fijalkow
+ PDF Chat	Controlling a Random Population	2020	Thomas Colcombet Nathanaël Fijalkow Pierre Ohlmann
+	Optimal Transformations of Muller Conditions	2020	Antonio Casares Thomas Colcombet Nathanaël Fijalkow
+	Alternating Tree Automata with Qualitative Semantics	2020	Raphaël Berthon Nathanaël Fijalkow Emmanuel Filiot Shibashis Guha Bastien Maubert Aniello Murano Laureline Pinault Sophie Pinchinat Sasha Rubin Olivier Serre
+ PDF Chat	A Robust Class of Linear Recurrence Sequences	2020	Corentin Barloy Nathanaël Fijalkow Nathan Lhote Filip Mazowiecki
+ PDF Chat	A Robust Class of Linear Recurrence Sequences	2020	Corentin Barloy Nathanaël Fijalkow Nathan Lhote Filip Mazowiecki
+ PDF Chat	Parity games and universal graphs	2019	Thomas Colcombet Nathanaël Fijalkow
+ PDF Chat	On the decidability of reachability in linear time-invariant systems	2019	Nathanaël Fijalkow Joël Ouaknine Amaury Pouly João Sousa-Pinto James Worrell
+ PDF Chat	Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem	2019	Nathanaël Fijalkow Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell
+ PDF Chat	On the Monniaux Problem in Abstract Interpretation	2019	Nathanaël Fijalkow Engel Lefaucheux Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell
+	Verification of Neural Networks: Specifying Global Robustness using Generative Models	2019	Nathanaël Fijalkow Mohit Gupta
+	Data Generation for Neural Programming by Example	2019	Judith Clymo Haik Manukian Nathanaël Fijalkow Adrià Gascón Brooks Paige
+ PDF Chat	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games	2019	Wojciech Czerwiński Laure Daviaud Nathanaël Fijalkow Marcin Jurdziński Ranko Lazić Paweł Parys
+	Lower bounds for the state complexity of probabilistic languages and the language of prime numbers	2019	Nathanaël Fijalkow
+	A Robust Class of Linear Recurrence Sequences	2019	Corentin Barloy Nathanaël Fijalkow Nathan Lhote Filip Mazowiecki
+ PDF Chat	An Optimal Value Iteration Algorithm for Parity Games	2018	Nathanaël Fijalkow
+	An Optimal Value Iteration Algorithm for Parity Games	2018	Nathanaël Fijalkow
+ PDF Chat	Timed Comparisons of Semi-Markov Processes	2018	Mathias Ruggaard Pedersen Nathanaël Fijalkow Giorgio Bacci Kim G. Larsen Radu Mardare
+	Parity games and universal graphs	2018	Thomas Colcombet Nathanaël Fijalkow
+	The complexity of mean payoff games using universal graphs	2018	Nathanaël Fijalkow Paweł Gawrychowski Pierre Ohlmann
+	An Optimal Value Iteration Algorithm for Parity Games	2018	Nathanaël Fijalkow
+	Timed Comparisons of Semi-Markov Processes	2017	Mathias Ruggaard Pedersen Nathanaël Fijalkow Giorgio Bacci Kim G. Larsen Radu Mardare
+	Profinite techniques for probabilistic automata and the Markov Monoid algorithm	2017	Nathanaël Fijalkow
+ PDF Chat	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem	2017	Nathanaël Fijalkow Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell
+	Timed Comparisons of Semi-Markov Processes	2017	Mathias Ruggaard Pedersen Nathanaël Fijalkow Giorgio Bacci Kim G. Larsen Radu Mardare
+	Trading Bounds for Memory in Games with Counters	2017	Nathanaël Fijalkow Florian Horn Denis Kuperberg Michał Skrzypczak
+	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem	2017	Nathanaël Fijalkow Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell
+ PDF Chat	Characterisation of an Algebraic Algorithm for Probabilistic Automata Characterisation of an Algebraic Algorithm for Probabilistic Automata	2016	Nathanaël Fijalkow
+	Lower Bounds for Alternating Online State Complexity	2016	Nathanaël Fijalkow
+ PDF Chat	Trace Refinement in Labelled Markov Decision Processes	2016	Nathanaël Fijalkow Stefan Kiefer Mahsa Shirmohammadi
+ PDF Chat	Deciding the value 1 problem for probabilistic leaktight automata	2015	Nathanaël Fijalkow Hugo Gimbert Edon Kelmendi Youssouf Oualhadj
+	Deciding the value 1 problem for probabilistic leaktight automata	2015	Nathanaël Fijalkow Hugo Gimbert Edon Kelmendi Youssouf Oualhadj
+ PDF Chat	Parity and Streett Games with Costs	2014	Nathanaël Fijalkow Martín Zimmermann
+	What is known about the Value 1 Problem for Probabilistic Automata?	2014	Nathanaël Fijalkow
+ PDF Chat	Two Recursively Inseparable Problems for Probabilistic Automata	2014	Nathanaël Fijalkow Hugo Gimbert Florian Horn Youssouf Oualhadj
+ PDF Chat	Monadic Second-Order Logic with Arbitrary Monadic Predicates	2014	Nathanaël Fijalkow Charles Paperman
+	Infinite-state games with finitary conditions	2013	Krishnendu Chatterjee Nathanaël Fijalkow
+	Cost-Parity and Cost-Streett Games	2012	Nathanaël Fijalkow Martín Zimmermann
+ PDF Chat	Parity and Streett Games with Costs	2012	Nathanaël Fijalkow Martín Zimmermann
+ PDF Chat	A reduction from parity games to simple stochastic games	2011	Krishnendu Chatterjee Nathanaël Fijalkow
+	Pushing undecidability of the isolation problem for probabilistic automata	2011	Nathanaël Fijalkow Hugo Gimbert Youssouf Oualhadj
+ PDF Chat	Finitary Languages	2011	Krishnendu Chatterjee Nathanaël Fijalkow
+	Deciding the Value 1 Problem of Probabilistic Leaktight Automata	2011	Nathanaël Fijalkow Hugo Gimbert Youssouf Oualhadj
+	The surprizing complexity of reachability games	2010	Nathanaël Fijalkow Florian Horn
+	The surprizing complexity of generalized reachability games	2010	Nathanaël Fijalkow Florian Horn

Common Coauthors

Coauthor	Papers Together
Pierre Ohlmann	15
Thomas Colcombet	12
Hugo Gimbert	7
James Worrell	7
Guillaume Lagarde	6
Amaury Pouly	6
Théo Matricon	6
Joël Ouaknine	5
Youssouf Oualhadj	5
Corentin Barloy	5
Nathan Lhote	5
Florian Horn	5
Olivier Serre	5
Filip Mazowiecki	5
Daniel Neider	4
Antonio Casares	4
Ritam Raha	4
Krishnendu Chatterjee	3
Bastien Maubert	3
Mathias Ruggaard Pedersen	3
Shibashis Guha	3
Giorgio Bacci	3
Paweł Gawrychowski	3
Sophie Pinchinat	3
Radu Mardare	3
Aniello Murano	3
Emmanuel Filiot	3
Sasha Rubin	3
Raphaël Berthon	3
Martín Zimmermann	3
Kim G. Larsen	3
Laureline Pinault	3
Gaëtan Margueritte	2
Kevin Ellis	2
Rajarshi Roy	2
Karoliina Lehtinen	2
Guillermo A. Pérez	2
Akarsh Nayan Potta	2
Rajarshi Roy	2
Mickaël Randour	2
Patricia Bouyer	2
Florian Horn	2
Pierre Vandenhove	2
Engel Lefaucheux	2
Edon Kelmendi	2
Marius Belly	1
Mahsa Shirmohammadi	1
Corto Mascle	1
Jérôme Leroux	1
Adrià Gascón	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Succinct progress measures for solving parity games	2017	Marcin Jurdziński Ranko Lazić	6
+ PDF Chat	Decidable Problems for Probabilistic Automata on Infinite Words	2012	Krishnendu Chatterjee Mathieu Tracol	5
+ PDF Chat	An Optimal Value Iteration Algorithm for Parity Games	2018	Nathanaël Fijalkow	4
+	Parity games and universal graphs	2018	Thomas Colcombet Nathanaël Fijalkow	4
+	The theory of well-quasi-ordering: A frequently discovered concept	1972	Joseph B. Kruskal	4
+ PDF Chat	Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences	2014	Joël Ouaknine James Worrell	4
+	Finiteness of the Odd Perfect and Primitive Abundant Numbers with n Distinct Prime Factors	1913	L. E. Dickson	4
+ PDF Chat	Deciding the value 1 problem for probabilistic leaktight automata	2015	Nathanaël Fijalkow Hugo Gimbert Edon Kelmendi Youssouf Oualhadj	4
+	Positivity problems for low-order linear recurrence sequences	2014	Joël Ouaknine James Worrell	3
+ PDF Chat	Algorithms for Omega-Regular Games with Imperfect Information	2007	Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger Jean-François Raskin	3
+	COMPUTING JORDAN NORMAL FORMS EXACTLY FOR COMMUTING MATRICES IN POLYNOMIAL TIME	1994	Jin‐Yi Cai	3
+ PDF Chat	Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games	2019	Wojciech Czerwiński Laure Daviaud Nathanaël Fijalkow Marcin Jurdziński Ranko Lazić Paweł Parys	3
+ PDF Chat	Regular Cost Functions, Part I: Logic and Algebra over Words	2013	Thomas Colcombet	3
+ PDF Chat	Half-Positional Determinacy of Infinite Games	2006	Eryk Kopczyński	3
+ PDF Chat	Decisive Markov Chains	2007	Parosh Aziz Abdulla Noomene Ben Henda Richard Mayr	3
+ PDF Chat	From Nondeterministic Buchi and Streett Automata to Deterministic Parity Automata	2006	Nir Piterman	3
+ PDF Chat	An ordered approach to solving parity games in quasi polynomial time and quasi linear space	2017	John Fearnley Sanjay Jain Sven Schewe Frank Stephan Dominik Wojtczak	3
+ PDF Chat	Improved Pseudo-polynomial Bound for the Value Problem and Optimal Strategy Synthesis in Mean Payoff Games	2016	Carlo Comin Roméo Rizzi	3
+ PDF Chat	The complexity of multi-mean-payoff and multi-energy games	2015	Yaron Velner Krishnendu Chatterjee Laurent Doyen Thomas A. Henzinger Alexander Rabinovich Jean-François Raskin	3
+ PDF Chat	Probabilistic automata of bounded ambiguity	2020	Nathanaël Fijalkow Cristian Riveros James Worrell	3
+ PDF Chat	Two Recursively Inseparable Problems for Probabilistic Automata	2014	Nathanaël Fijalkow Hugo Gimbert Florian Horn Youssouf Oualhadj	3
+ PDF Chat	Analytical approach to parallel repetition	2014	Irit Dinur David Steurer	3
+ PDF Chat	A pseudo-quasi-polynomial algorithm for mean-payoff parity games	2018	Laure Daviaud Marcin Jurdziński Ranko Lazić	3
+	An Optimal Value Iteration Algorithm for Parity Games	2018	Nathanaël Fijalkow	3
+	On minimal universal trees	1968	Mark Goldberg �. M. Livshits	3
+ PDF Chat	On the decidability of the existence of polyhedral invariants in transition systems	2018	David Monniaux	2
+	An Ordered Approach to Solving Parity Games in Quasi Polynomial Time and Quasi Linear Space	2017	John Fearnley Sanjay Jain Sven Schewe Frank Stephan Dominik Wojtczak	2
+ PDF Chat	Reachability Games on Extended Vector Addition Systems with States	2010	Tomǎš Brázdil Petr Jančar Antonı́n Kučera	2
+	Polynomial Invariants for Affine Programs	2018	Ehud Hrushovski Joël Ouaknine Amaury Pouly James Worrell	2
+ PDF Chat	Qualitative Concurrent Stochastic Games with Imperfect Information	2009	Vincent Gripon Olivier Serre	2
+ PDF Chat	Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem	2019	Nathanaël Fijalkow Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell	2
+	Leveraging Grammar and Reinforcement Learning for Neural Program Synthesis	2018	Rudy Bunel Matthew Hausknecht Jacob Devlin Rishabh Singh Pushmeet Kohli	2
+ PDF Chat	Learning Linear Temporal Properties	2018	Daniel Neider Ivan Gavran	2
+	Factorization forests of finite height	1990	Imre Simon	2
+	Monadic Second-Order Logic with Path-Measure Quantifier is Undecidable.	2019	Raphaël Berthon Emmanuel Filiot Shibashis Guha Bastien Maubert Aniello Murano Laureline Pinault Jean-François Raskin Sasha Rubin	2
+	Parity Games: Zielonka's Algorithm in Quasi-Polynomial Time	2019	Paweł Parys	2
+ PDF Chat	Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem	2017	Nathanaël Fijalkow Pierre Ohlmann Joël Ouaknine Amaury Pouly James Worrell	2
+	A short proof of correctness of the quasi-polynomial time algorithm for parity games	2017	Hugo Gimbert Rasmus Ibsen-Jensen	2
+ PDF Chat	Unusually large gaps between consecutive primes	1990	Helmut Maier Carl Pomerance	2
+ PDF Chat	PRIMES is in P	2004	Manindra Agrawal Neeraj Kayal Nitin Saxena	2
+ PDF Chat	ARSENAL: Automatic Requirements Specification Extraction from Natural Language	2016	Shalini Ghosh Daniel Elenius Wenchao Li Patrick Lincoln Natarajan Shankar Wilfried Steiner	2
+ PDF Chat	Parity and Streett Games with Costs	2014	Nathanaël Fijalkow Martín Zimmermann	2
+ PDF Chat	Optimal Strategy Synthesis in Request-Response Games	2008	Florian Horn Wolfgang Thomas Nico Wallmeier	2
+ PDF Chat	Exponential Lower Bounds for Policy Iteration	2010	John Fearnley	2
+	Profile trees for Büchi word automata, with application to determinization	2015	Seth Fogarty Orna Kupferman Moshe Y. Vardi Thomas Wilke	2
+ PDF Chat	Index Appearance Record for Transforming Rabin Automata into Parity Automata	2017	Jan Křetínský Tobias Meggendorfer Clara Waldmann Maximilian Weininger	2
+ PDF Chat	A note on recurring series	1953	Christer Lech	2
+	An Introduction to Diophantine Approximation.	1958	John C. Brixey J. W. S. Cassels	2
+	On the positional determinacy of edge-labeled games	2005	Thomas Colcombet Damian Niwiński	2
+	A Course in Computational Algebraic Number Theory	1993	Henri Cohen	2