| Finitary winning in ω-regular games K Chatterjee, TA Henzinger, F Horn ACM Transactions on Computational Logic (TOCL) 11 (1), 1-27, 2009 | 67 | 2009 |
| Streett games on finite graphs F Horn Proc. 2nd Workshop Games in Design Verification (GDV), 2005 | 50 | 2005 |
| Explicit Muller games are PTIME F Horn IARCS Annual Conference on Foundations of Software Technology and …, 2008 | 44 | 2008 |
| Solving simple stochastic tail games H Gimbert, F Horn Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 40 | 2010 |
| Simple stochastic games with few random vertices are easy to solve H Gimbert, F Horn Foundations of Software Science and Computational Structures: 11th …, 2008 | 40 | 2008 |
| Optimal strategy synthesis in request-response games F Horn, W Thomas, N Wallmeier International Symposium on Automated Technology for Verification and …, 2008 | 29 | 2008 |
| The surprizing complexity of generalized reachability games N Fijalkow, F Horn arXiv preprint arXiv:1010.2420, 2010 | 24 | 2010 |
| The complexity of request-response games K Chatterjee, TA Henzinger, F Horn International Conference on Language and Automata Theory and Applications …, 2011 | 21 | 2011 |
| Playing safe T Colcombet, N Fijalkow, F Horn 34th International Conference on Foundation of Software Technology and …, 2014 | 18 | 2014 |
| SELF-STABILIZING k-out-of-ℓ EXCLUSION IN TREE NETWORKS AK Datta, S Devismes, F Horn, LL Larmore International Journal of Foundations of Computer Science 22 (03), 657-677, 2011 | 18 | 2011 |
| Random games F Horn, W Thomas Fachgruppe Informatik, 2008 | 18 | 2008 |
| Entropy games and matrix multiplication games E Asarin, J Cervelle, A Degorre, C Dima, F Horn, V Kozyakin arXiv preprint arXiv:1506.04885, 2015 | 17 | 2015 |
| Les jeux d'accessibilité généralisée. N Fijalkow, F Horn Tech. Sci. Informatiques 32 (9-10), 931-949, 2013 | 16 | 2013 |
| Obliging games K Chatterjee, F Horn, C Löding International Conference on Concurrency Theory, 284-296, 2010 | 13 | 2010 |
| Solving simple stochastic games with few random vertices H Gimbert, F Horn Logical Methods in Computer Science 5, 2009 | 13 | 2009 |
| Games on graphs N Fijalkow, N Bertrand, P Bouyer-Decitre, R Brenguier, A Carayol, ... arXiv preprint arXiv:2305.10546, 2023 | 12 | 2023 |
| Optimal strategy synthesis for request-response games F Horn, W Thomas, N Wallmeier, M Zimmermann RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2015 | 12 | 2015 |
| Random fruits on the Zielonka tree F Horn arXiv preprint arXiv:0902.2736, 2009 | 12 | 2009 |
| Faster algorithms for finitary games F Horn International Conference on Tools and Algorithms for the Construction and …, 2007 | 11 | 2007 |
| Trading bounds for memory in games with counters N Fijalkow, F Horn, D Kuperberg, M Skrzypczak International Colloquium on Automata, Languages, and Programming, 197-208, 2015 | 8 | 2015 |
