Folgen
Nathanaël Fijalkow
Nathanaël Fijalkow
CNRS, LaBRI, Bordeaux
Bestätigte E-Mail-Adresse bei labri.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Universal trees grow inside separating automata: Quasi-polynomial lower bounds for parity games
W Czerwiński, L Daviaud, N Fijalkow, M Jurdziński, R Lazić, P Parys
SODA, Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2333-2349, 2019
562019
Deciding the value 1 problem for probabilistic leaktight automata
N Fijalkow, H Gimbert, Y Oualhadj
LICS, 27th Annual IEEE/ACM Symposium on Logic in Computer Science, 295-304, 2012
542012
Les jeux d'accessibilité généralisée.
N Fijalkow, F Horn
Tech. Sci. Informatiques 32 (9-10), 931-949, 2013
43*2013
On the decidability of reachability in linear time-invariant systems
N Fijalkow, J Ouaknine, A Pouly, J Sousa-Pinto, J Worrell
HSCC, 22nd ACM International Conference on Hybrid Systems: Computation and …, 2019
352019
Scalable anytime algorithms for learning fragments of linear temporal logic
R Raha, R Roy, N Fijalkow, D Neider
TACAS, International Conference on Tools and Algorithms for the Construction …, 2022
342022
A reduction from parity games to simple stochastic games
K Chatterjee, N Fijalkow
GanDALF, Games, Automata, Logics, and Formal Verification, 2011
322011
The complexity of learning linear temporal formulas from examples
N Fijalkow, G Lagarde
ICGI, International Conference on Grammatical Inference, 237-250, 2021
312021
Universal graphs and good for games automata: New tools for infinite duration games
T Colcombet, N Fijalkow
FoSSaCS, International Conference on Foundations of Software Science and …, 2019
302019
The Theory of Universal Graphs for Infinite Duration Games
P Ohlmann, P Gawrychowski, N Fijalkow, T Colcombet
Logical Methods in Computer Science 18, 2022
29*2022
Games on graphs
N Fijalkow, N Bertrand, P Bouyer-Decitre, R Brenguier, A Carayol, ...
arXiv preprint arXiv:2305.10546, 2023
272023
Cost-parity and cost-streett games
N Fijalkow, M Zimmermann
FST&TCS, 42nd IARCS Annual Conference on Foundations of Software Technology …, 2012
272012
Infinite-state games with finitary conditions
K Chatterjee, N Fijalkow
CSL, Computer Science in Logic, 2013
262013
Parity and Streett Games with Costs
N Fijalkow, M Zimmermann
Logical Methods in Computer Science 10 (2), 2012
262012
Optimal Transformations of Games and Automata Using Muller Conditions
A Casares, T Colcombet, N Fijalkow
ICALP, 48th International Colloquium on Automata, Languages, and Programming …, 2021
25*2021
Probabilistic automata of bounded ambiguity
N Fijalkow, C Riveros, J Worrell
Information and Computation 282, 104648, 2022
242022
Undecidability results for probabilistic automata
N Fijalkow
ACM SIGLOG News 4 (4), 10-17, 2017
242017
Value iteration using universal graphs and the complexity of mean payoff games
N Fijalkow, P Gawrychowski, P Ohlmann
MFCS, 45th International Symposium on Mathematical Foundations of Computer …, 2020
20*2020
Expressiveness of probabilistic modal logics, revisited
N Fijalkow, B Klin, P Panangaden
ICALP, 44th International Colloquium on Automata, Languages, and Programming, 2017
202017
Playing safe
T Colcombet, N Fijalkow, F Horn
FST&TCS, 34th International Conference on Foundation of Software Technology …, 2014
192014
Scaling Neural Program Synthesis with Distribution-based Search
N Fijalkow, G Lagarde, T Matricon, K Ellis, P Ohlmann, AN Potta
AAAI, Conference on Artificial Intelligence 36 (6), 6623-6630, 2022
172022
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20