| 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 | 54 | 2019 |
| 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 | 51 | 2012 |
| Les jeux d'accessibilité généralisée. N Fijalkow, F Horn Tech. Sci. Informatiques 32 (9-10), 931-949, 2013 | 37* | 2013 |
| 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 | 30 | 2019 |
| 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 | 29 | 2019 |
| Cost-parity and cost-streett games N Fijalkow, M Zimmermann FST&TCS, 42nd IARCS Annual Conference on Foundations of Software Technology …, 2012 | 28 | 2012 |
| The Theory of Universal Graphs for Infinite Duration Games P Ohlmann, P Gawrychowski, N Fijalkow, T Colcombet Logical Methods in Computer Science 18, 2022 | 27* | 2022 |
| Parity and Streett Games with Costs N Fijalkow, M Zimmermann Logical Methods in Computer Science 10 (2), 2012 | 27 | 2012 |
| Infinite-state games with finitary conditions K Chatterjee, N Fijalkow CSL, Computer Science in Logic, 2013 | 26 | 2013 |
| 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 | 25 | 2022 |
| 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 | 24 | 2021 |
| The complexity of learning linear temporal formulas from examples N Fijalkow, G Lagarde ICGI, International Conference on Grammatical Inference, 237-250, 2021 | 23 | 2021 |
| A reduction from parity games to simple stochastic games K Chatterjee, N Fijalkow GanDALF, Games, Automata, Logics, and Formal Verification, 2011 | 23 | 2011 |
| Undecidability results for probabilistic automata N Fijalkow ACM SIGLOG News 4 (4), 10-17, 2017 | 22 | 2017 |
| Probabilistic automata of bounded ambiguity N Fijalkow, C Riveros, J Worrell Information and Computation 282, 104648, 2022 | 20 | 2022 |
| Expressiveness of probabilistic modal logics, revisited N Fijalkow, B Klin, P Panangaden ICALP, 44th International Colloquium on Automata, Languages, and Programming, 2017 | 19 | 2017 |
| 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 | 18* | 2020 |
| Playing safe T Colcombet, N Fijalkow, F Horn FST&TCS, 34th International Conference on Foundation of Software Technology …, 2014 | 17 | 2014 |
| Consistent unsupervised estimators for anchored PCFGs A Clark, N Fijalkow Transactions of the Association for Computational Linguistics 8, 409-422, 2020 | 14 | 2020 |
| Data generation for neural programming by example J Clymo, H Manukian, N Fijalkow, A Gascón, B Paige AI&STAT, International Conference on Artificial Intelligence and Statistics …, 2020 | 14 | 2020 |
Florian HornChargé de Recherches, IRIF, CNRS & Université Paris Diderot - Paris 7在 irif.fr 的电子邮件经过验证
