default search action
Nathanaël Fijalkow
Person information
- affiliation: CNRS Bordeaux, France
- affiliation (former): Alan Turing Institute of Data Science, London, UK
- affiliation (former): University of Warsaw, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j22]Ritam Raha
, Rajarshi Roy
Scarlet: Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. J. Open Source Softw. 9(93): 5052 (2024) - [j21]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. Log. Methods Comput. Sci. 20(1) (2024) - [j20]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History) Determinism. TheoretiCS 3 (2024) - [c45]Mojtaba Valizadeh
LTL Learning on GPUs. CAV (3) 2024: 209-231 - [c44]Ritam Raha
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. VMCAI (2) 2024: 264-288 - [i45]Guruprerana Shabadi, Nathanaël Fijalkow, Théo Matricon:
Theoretical foundations for programmatic reinforcement learning. CoRR abs/2402.11650 (2024) - [i44]Mojtaba Valizadeh, Nathanaël Fijalkow, Martin Berger:
LTL learning on GPUs. CoRR abs/2402.12373 (2024) - 2023
- [c43]Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove
How to Play Optimally for Regular Objectives? ICALP 2023: 118:1-118:18 - [c42]Théo Matricon
WikiCoder: Learning to Write Knowledge-Powered Code. SPIN 2023: 123-140 - [i43]Théo Matricon, Nathanaël Fijalkow, Gaëtan Margueritte:
WikiCoder: Learning to Write Knowledge-Powered Code. CoRR abs/2303.08574 (2023) - [i42]Antonio Casares, Thomas Colcombet, Nathanaël Fijalkow, Karoliina Lehtinen:
From Muller to Parity and Rabin Automata: Optimal Transformations Preserving (History-)Determinism. CoRR abs/2305.04323 (2023) - [i41]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 abs/2305.10546 (2023) - [i40]Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider, Guillermo A. Pérez:
Synthesizing Efficiently Monitorable Formulas in Metric Temporal Logic. CoRR abs/2310.17410 (2023) - [i39]Corto Mascle, Nathanaël Fijalkow, Guillaume Lagarde:
Learning temporal formulas from examples is hard. CoRR abs/2312.16336 (2023) - [i38]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): 166-184 (2023) - 2022
- [b2]Nathanaël Fijalkow:
The Game of Synthesis. University of Bordeaux, France, 2022 - [j19]Nathanaël Fijalkow, Cristian Riveros
Probabilistic automata of bounded ambiguity. Inf. Comput. 282: 104648 (2022) - [j18]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A robust class of linear recurrence sequences. Inf. Comput. 289(Part): 104964 (2022) - [j17]Théo Matricon
DeepSynth: Scaling Neural Program Synthesis with Distribution-based Search. J. Open Source Softw. 7(78): 4151 (2022) - [j16]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) - [c41]Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon
Scaling Neural Program Synthesis with Distribution-Based Search. AAAI 2022: 6623-6630 - [c40]Nathanaël Fijalkow, Bastien Maubert, Aniello Murano, Sasha Rubin, Moshe Y. Vardi:
Public and Private Affairs in Strategic Reasoning. KR 2022 - [c39]Ritam Raha
Scalable Anytime Algorithms for Learning Fragments of Linear Temporal Logic. TACAS (1) 2022: 263-280 - [i37]Nathanaël Fijalkow, Cristian Riveros, James Worrell:
Probabilistic Automata of Bounded Ambiguity. CoRR abs/2205.08175 (2022) - [i36]Patricia Bouyer, Nathanaël Fijalkow, Mickael Randour, Pierre Vandenhove:
How to Play Optimally for Regular Objectives? CoRR abs/2210.09703 (2022) - [i35]Thomas Colcombet, Nathanaël Fijalkow, Florian Horn:
Playing Safe, Ten Years Later. CoRR abs/2212.12024 (2022) - 2021
- [j15]Nathanaël Fijalkow
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. Comput. Complex. 30(2): 14 (2021) - [j14]Thomas Colcombet
Controlling a random population. Log. Methods Comput. Sci. 17(4) (2021) - [j13]Raphaël Berthon
Alternating Tree Automata with Qualitative Semantics. ACM Trans. Comput. Log. 22(1): 7:1-7:24 (2021) - [c38]Théo Matricon
Statistical Comparison of Algorithm Performance Through Instance Selection. CP 2021: 43:1-43:21 - [c37]Antonio Casares, Thomas Colcombet
Optimal Transformations of Games and Automata Using Muller Conditions. ICALP 2021: 123:1-123:14 - [c36]Nathanaël Fijalkow
The complexity of learning linear temporal formulas from examples. ICGI 2021: 237-250 - [c35]Ashwani Anand
New Algorithms for Combinations of Objectives using Separating Automata. GandALF 2021: 227-240 - [i34]Nathanaël Fijalkow, Guillaume Lagarde:
The Complexity of Learning Linear Temporal Formulas from Examples. CoRR abs/2102.00876 (2021) - [i33]Thomas Colcombet, Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The Theory of Universal Graphs for Infinite Duration Games. CoRR abs/2104.05262 (2021) - [i32]Ritam Raha, Rajarshi Roy, Nathanaël Fijalkow, Daniel Neider:
Scalable Anytime Algorithms for Learning Formulas in Linear Temporal Logic. CoRR abs/2110.06726 (2021) - [i31]Nathanaël Fijalkow, Guillaume Lagarde, Théo Matricon, Kevin Ellis, Pierre Ohlmann, Akarsh Potta:
Scaling Neural Program Synthesis with Distribution-based Search. CoRR abs/2110.12485 (2021) - 2020
- [j12]Nathanaël Fijalkow
Trace Refinement in Labelled Markov Decision Processes. Log. Methods Comput. Sci. 16(2) (2020) - [j11]Nathanaël Fijalkow
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. J. Log. Comput. 30(1): 175-192 (2020) - [j10]Alexander Clark, Nathanaël Fijalkow
Consistent Unsupervised Estimators for Anchored PCFGs. Trans. Assoc. Comput. Linguistics 8: 409-422 (2020) - [c34]Judith Clymo, Adrià Gascón, Brooks Paige, Nathanaël Fijalkow
Data Generation for Neural Programming by Example. AISTATS 2020: 3450-3459 - [c33]Nathanaël Fijalkow
The Theory of Universal Graphs for Games: Past and Future. CMCS 2020: 1-10 - [c32]Corentin Barloy
A Robust Class of Linear Recurrence Sequences. CSL 2020: 9:1-9:16 - [c31]Thomas Colcombet, Nathanaël Fijalkow, Pierre Ohlmann:
Controlling a Random Population. FoSSaCS 2020: 119-135 - [c30]Nathanaël Fijalkow
Assume-Guarantee Synthesis for Prompt Linear Temporal Logic. IJCAI 2020: 117-123 - [c29]Nathanaël Fijalkow
Value Iteration Using Universal Graphs and the Complexity of Mean Payoff Games. MFCS 2020: 34:1-34:15 - [c28]Nathanaël Fijalkow
Lower Bounds for Arithmetic Circuits via the Hankel Matrix. STACS 2020: 24:1-24:17 - [i30]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 abs/2002.03664 (2020) - [i29]Antonio Casares, Thomas Colcombet
Optimal transformations of Muller conditions. CoRR abs/2011.13041 (2020)
2010 – 2019
- 2019
- [j9]Florence Clerc, Nathanaël Fijalkow
Expressiveness of probabilistic modal logics: A gradual approach. Inf. Comput. 267: 145-163 (2019) - [j8]Nathanaël Fijalkow
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. Theory Comput. Syst. 63(5): 1027-1048 (2019) - [c27]Thomas Colcombet, Nathanaël Fijalkow:
Universal Graphs and Good for Games Automata: New Tools for Infinite Duration Games. FoSSaCS 2019: 1-26 - [c26]Nathanaël Fijalkow
On the decidability of reachability in linear time-invariant systems. HSCC 2019: 77-86 - [c25]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell
On the Monniaux Problem in Abstract Interpretation. SAS 2019: 162-180 - [c24]Wojciech Czerwinski, Laure Daviaud
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games. SODA 2019: 2333-2349 - [i28]Nathanaël Fijalkow, Engel Lefaucheux, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
On the Monniaux Problem in Abstract Interpretation. CoRR abs/1907.08257 (2019) - [i27]Corentin Barloy, Nathanaël Fijalkow, Nathan Lhote, Filip Mazowiecki:
A Robust Class of Linear Recurrence Sequences. CoRR abs/1908.03890 (2019) - [i26]Nathanaël Fijalkow, Mohit Kumar Gupta:
Verification of Neural Networks: Specifying Global Robustness using Generative Models. CoRR abs/1910.05018 (2019) - [i25]Thomas Colcombet
Controlling a random population. CoRR abs/1911.01195 (2019) - [i24]Judith Clymo, Haik Manukian, Nathanaël Fijalkow, Adrià Gascón, Brooks Paige:
Data Generation for Neural Programming by Example. CoRR abs/1911.02624 (2019) - [i23]Nathanaël Fijalkow
Lower bounds for the state complexity of probabilistic languages and the language of prime numbers. CoRR abs/1912.11396 (2019) - 2018
- [c23]Nathanaël Fijalkow
Quantifying Bounds in Strategy Logic. CSL 2018: 23:1-23:23 - [c22]Mathias Ruggaard Pedersen
Timed Comparisons of Semi-Markov Processes. LATA 2018: 271-283 - [c21]Nathanaël Fijalkow
The State Complexity of Alternating Automata. LICS 2018: 414-421 - [i22]Nathanaël Fijalkow:
An Optimal Value Iteration Algorithm for Parity Games. CoRR abs/1801.09618 (2018) - [i21]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 abs/1802.06575 (2018) - [i20]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 abs/1807.10546 (2018) - [i19]Thomas Colcombet
Parity games and universal graphs. CoRR abs/1810.05106 (2018) - [i18]Nathanaël Fijalkow, Pawel Gawrychowski, Pierre Ohlmann:
The complexity of mean payoff games using universal graphs. CoRR abs/1812.07072 (2018) - [i17]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann:
Tight Bounds using Hankel Matrix for Arithmetic Circuits with Unique Parse Trees. Electron. Colloquium Comput. Complex. TR18 (2018) - [i16]Nathanaël Fijalkow, Guillaume Lagarde, Pierre Ohlmann, Olivier Serre:
Lower bounds for arithmetic circuits via the Hankel matrix. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [j7]Nathanaël Fijalkow
Profinite Techniques for Probabilistic Automata. Bull. EATCS 122 (2017) - [j6]Nathanaël Fijalkow
Undecidability results for probabilistic automata. ACM SIGLOG News 4(4): 10-17 (2017) - [j5]Nathanaël Fijalkow
Profinite techniques for probabilistic automata and the Markov Monoid algorithm. Theor. Comput. Sci. 680: 1-14 (2017) - [j4]Nathanaël Fijalkow
Monadic Second-Order Logic with Arbitrary Monadic Predicates. ACM Trans. Comput. Log. 18(3): 20:1-20:17 (2017) - [c20]Nathanaël Fijalkow
Probabilistic Automata of Bounded Ambiguity. CONCUR 2017: 19:1-19:14 - [c19]Nathanaël Fijalkow
Expressiveness of Probabilistic Modal Logics, Revisited. ICALP 2017: 105:1-105:12 - [c18]Nathanaël Fijalkow
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. STACS 2017: 29:1-29:13 - [c17]Nathanaël Fijalkow
Stamina: Stabilisation Monoids in Automata Theory. CIAA 2017: 101-112 - [i15]Nathanaël Fijalkow, Pierre Ohlmann, Joël Ouaknine, Amaury Pouly, James Worrell:
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem. CoRR abs/1701.02162 (2017) - [i14]Nathanaël Fijalkow, Charles Paperman:
Monadic Second-Order Logic with Arbitrary Monadic Predicates. CoRR abs/1709.03117 (2017) - [i13]Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak:
Trading Bounds for Memory in Games with Counters. CoRR abs/1709.03121 (2017) - [i12]Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. CoRR abs/1709.03122 (2017) - [i11]Mathias Ruggaard Pedersen, Nathanaël Fijalkow, Giorgio Bacci, Kim Guldstrand Larsen, Radu Mardare:
Timed Comparisons of Semi-Markov Processes. CoRR abs/1711.10216 (2017) - 2016
- [c16]Nathanaël Fijalkow
Trace Refinement in Labelled Markov Decision Processes. FoSSaCS 2016: 303-318 - [c15]Thomas Colcombet
The Bridge Between Regular Cost Functions and Omega-Regular Languages. ICALP 2016: 126:1-126:13 - [c14]Nathanaël Fijalkow
The Online Space Complexity of Probabilistic Languages. LFCS 2016: 106-116 - [c13]Nathanaël Fijalkow
Characterisation of an Algebraic Algorithm for Probabilistic Automata. STACS 2016: 34:1-34:13 - [i10]Nathanaël Fijalkow:
Lower Bounds for Alternating Online Space Complexity. CoRR abs/1607.00259 (2016) - [i9]Nathanaël Fijalkow:
Lower Bounds for Alternating Online Space Complexity. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [b1]Nathanaël Fijalkow:
Counting and Randomising in Automata Theory. (Compteurs et Aléas en Théorie des Automates). Paris Diderot University, France, 2015 - [j3]Nathanaël Fijalkow
Deciding the value 1 problem for probabilistic leaktight automata. Log. Methods Comput. Sci. 11(2) (2015) - [c12]Nathanaël Fijalkow
Trading Bounds for Memory in Games with Counters. ICALP (2) 2015: 197-208 - [c11]Nathanaël Fijalkow
Irregular Behaviours for Probabilistic Automata. RP 2015: 33-36 - [i8]Nathanaël Fijalkow:
Profinite Techniques for Probabilistic Automata and the Optimality of the Markov Monoid Algorithm. CoRR abs/1501.02997 (2015) - [i7]Nathanaël Fijalkow, Stefan Kiefer, Mahsa Shirmohammadi:
Trace Refinement in Labelled Markov Decision Processes. CoRR abs/1510.09102 (2015) - 2014
- [j2]Nathanaël Fijalkow
Parity and Streett Games with Costs. Log. Methods Comput. Sci. 10(2) (2014) - [c10]Nathanaël Fijalkow
ACME: Automata with Counters, Monoids and Equivalence. ATVA 2014: 163-167 - [c9]Thomas Colcombet, Nathanaël Fijalkow
Playing Safe. FSTTCS 2014: 379-390 - [c8]Nathanaël Fijalkow
Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) 2014: 267-278 - [c7]Nathanaël Fijalkow
Monadic Second-Order Logic with Arbitrary Monadic Predicates. MFCS (1) 2014: 279-290 - [i6]Nathanaël Fijalkow:
What is known about the Value 1 Problem for Probabilistic Automata? CoRR abs/1410.3770 (2014) - 2013
- [j1]Nathanaël Fijalkow
Les jeux d'accessibilité généralisée. Tech. Sci. Informatiques 32(9-10): 931-949 (2013) - [c6]Krishnendu Chatterjee, Nathanaël Fijalkow
Infinite-state games with finitary conditions. CSL 2013: 181-196 - [c5]Nathanaël Fijalkow
Emptiness Of Alternating Tree Automata Using Games With Imperfect Information. FSTTCS 2013: 299-311 - [i5]Krishnendu Chatterjee, Nathanaël Fijalkow:
Infinite-state games with finitary conditions. CoRR abs/1301.2661 (2013) - 2012
- [c4]Nathanaël Fijalkow
Cost-Parity and Cost-Streett Games. FSTTCS 2012: 124-135 - [c3]Nathanaël Fijalkow
Deciding the Value 1 Problem for Probabilistic Leaktight Automata. LICS 2012: 295-304 - 2011
- [c2]Krishnendu Chatterjee, Nathanaël Fijalkow
Finitary Languages. LATA 2011: 216-226 - [c1]Krishnendu Chatterjee, Nathanaël Fijalkow
A reduction from parity games to simple stochastic games. GandALF 2011: 74-86 - [i4]Krishnendu Chatterjee, Nathanaël Fijalkow:
Finitary languages. CoRR abs/1101.1727 (2011) - [i3]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
Pushing undecidability of the isolation problem for probabilistic automata. CoRR abs/1104.3054 (2011) - [i2]Nathanaël Fijalkow, Hugo Gimbert, Youssouf Oualhadj
A Class of Probabilistic Automata with a Decidable Value 1 Problem. CoRR abs/1104.3055 (2011) - 2010
- [i1]Nathanaël Fijalkow, Florian Horn:
The surprizing complexity of reachability games. CoRR abs/1010.2420 (2010)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-11 00:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: