Nathanal Fijalkow
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
38
Venues
20
Active years
2011–2026
Best venue rank
A*
Where they publish
Papers
38 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | TACAS | LTL | Gabriel Bathie, Nathanal Fijalkow, Tho Matricon, Baptiste Mouillon, Pierre Vandenhove |
| 2025 | AAAI | Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. | Marius Belly, Nathanal Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Prez, Pierre Vandenhove |
| 2025 | AAAI | Eco Search: A No-delay Best-First Search Algorithm for Program Synthesis. | Tho Matricon, Nathanal Fijalkow, Guillaume Lagarde |
| 2025 | ICALP | The Trichotomy of Regular Property Testing. | Gabriel Bathie, Nathanal Fijalkow, Corto Mascle |
| 2024 | CAV | LTL Learning on GPUs. | Mojtaba Valizadeh, Nathanal Fijalkow, Martin Berger |
| 2024 | VMCAI | Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. | Ritam Raha, Rajarshi Roy, Nathanal Fijalkow, Daniel Neider, Guillermo A. Prez |
| 2023 | ICALP | How to Play Optimally for Regular Objectives? | Patricia Bouyer, Nathanal Fijalkow, Mickael Randour, Pierre Vandenhove |
| 2022 | AAAI | Scaling Neural Program Synthesis with Distribution-Based Search. | Nathanal Fijalkow, Guillaume Lagarde, Tho Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Nayan Potta |
| 2022 | KR | Public and Private Affairs in Strategic Reasoning. | Nathanal Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi |
| 2022 | TACAS | Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. | Ritam Raha, Rajarshi Roy, Nathanal Fijalkow, Daniel Neider |
| 2021 | CP | Statistical Comparison of Algorithm Performance Through Instance Selection. | Tho Matricon, Marie Anastacio, Nathanal Fijalkow, Laurent Simon, Holger H. Hoos |
| 2021 | ICALP | Optimal Transformations of Games and Automata Using Muller Conditions. | Antonio Casares, Thomas Colcombet, Nathanal Fijalkow |
| 2020 | AISTATS | Data Generation for Neural Programming by Example. | Judith Clymo, Adri Gascn, Brooks Paige, Nathanal Fijalkow, Haik Manukian |
| 2020 | CSL | A Robust Class of Linear Recurrence Sequences. | Corentin Barloy, Nathanal Fijalkow, Nathan Lhote, Filip Mazowiecki |
| 2020 | FOSSACS | Controlling a Random Population. | Thomas Colcombet, Nathanal Fijalkow, Pierre Ohlmann |
| 2020 | IJCAI | Assume-Guarantee Synthesis for Prompt Linear Temporal Logic. | Nathanal Fijalkow, Bastien Maubert, Aniello Murano, Moshe Y. Vardi |
| 2020 | MFCS | Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. | Nathanal Fijalkow, Pawel Gawrychowski, Pierre Ohlmann |
| 2020 | STACS | Lower Bounds for Arithmetic Circuits via the Hankel Matrix. | Nathanal Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre |
| 2019 | FOSSACS | Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. | Thomas Colcombet, Nathanal Fijalkow |
| 2019 | SODA | Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. | Wojciech Czerwinski, Laure Daviaud, Nathanal Fijalkow, Marcin Jurdzinski, Ranko Lazic, Pawel Parys |
| 2019 | SAS | On the Monniaux Problem in Abstract Interpretation. | Nathanal Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2018 | CSL | Quantifying Bounds in Strategy Logic. | Nathanal Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin |
| 2018 | LATA | Timed Comparisons of Semi-Markov Processes. | Mathias Ruggaard Pedersen, Nathanal Fijalkow, Giorgio Bacci, Kim G. Larsen, Radu Mardare |
| 2018 | LICS | The State Complexity of Alternating Automata. | Nathanal Fijalkow |
| 2017 | CONCUR | Probabilistic Automata of Bounded Ambiguity. | Nathanal Fijalkow, Cristian Riveros, James Worrell |
| 2017 | ICALP | Expressiveness of Probabilistic Modal Logics, Revisited. | Nathanal Fijalkow, Bartek Klin, Prakash Panangaden |
| 2017 | STACS | Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. | Nathanal Fijalkow, Pierre Ohlmann, Jol Ouaknine, Amaury Pouly, James Worrell |
| 2016 | FOSSACS | Trace Refinement in Labelled Markov Decision Processes. | Nathanal Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi |
| 2016 | ICALP | The Bridge Between Regular Cost Functions and Omega-Regular Languages. | Thomas Colcombet, Nathanal Fijalkow |
| 2016 | LFCS | The Online Space Complexity of Probabilistic Languages. | Nathanal Fijalkow |
| 2016 | STACS | Characterisation of an Algebraic Algorithm for Probabilistic Automata. | Nathanal Fijalkow |
| 2015 | ICALP | Trading Bounds for Memory in Games with Counters. | Nathanal Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak |
| 2014 | ATVA | ACME: Automata with Counters, Monoids and Equivalence. | Nathanal Fijalkow, Denis Kuperberg |
| 2014 | MFCS | Two Recursively Inseparable Problems for Probabilistic Automata. | Nathanal Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj |
| 2014 | MFCS | Monadic Second-Order Logic with Arbitrary Monadic Predicates. | Nathanal Fijalkow, Charles Paperman |
| 2013 | CSL | Infinite-state games with finitary conditions. | Krishnendu Chatterjee, Nathanal Fijalkow |
| 2012 | LICS | Deciding the Value 1 Problem for Probabilistic Leaktight Automata. | Nathanal Fijalkow, Hugo Gimbert, Youssouf Oualhadj |
| 2011 | LATA | Finitary Languages. | Krishnendu Chatterjee, Nathanal Fijalkow |