Florian Horn
Florian Horn
Chargé de Recherches, IRIF, CNRS & Université Paris Diderot - Paris 7
Verified email at irif.fr - Homepage
Title
Cited by
Cited by
Year
Finitary winning in ω-regular games
K Chatterjee, TA Henzinger, F Horn
ACM Transactions on Computational Logic (TOCL) 11 (1), 1-27, 2009
622009
Streett games on finite graphs
F Horn
Proc. 2nd Workshop Games in Design Verification (GDV), 2005
482005
Explicit Muller games are PTIME
F Horn
IARCS Annual Conference on Foundations of Software Technology and …, 2008
352008
Simple stochastic games with few random vertices are easy to solve
H Gimbert, F Horn
International Conference on Foundations of Software Science and …, 2008
342008
Solving simple stochastic tail games
H Gimbert, F Horn
Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010
322010
Optimal strategy synthesis in request-response games
F Horn, W Thomas, N Wallmeier
International Symposium on Automated Technology for Verification and …, 2008
322008
The complexity of request-response games
K Chatterjee, TA Henzinger, F Horn
International Conference on Language and Automata Theory and Applications …, 2011
202011
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
172011
Random games
F Horn, W Thomas
Fachgruppe Informatik, 2008
162008
Entropy games and matrix multiplication games
E Asarin, J Cervelle, A Degorre, C Dima, F Horn, V Kozyakin
arXiv preprint arXiv:1506.04885, 2015
142015
Optimal strategy synthesis for request-response games
F Horn, W Thomas, N Wallmeier, M Zimmermann
RAIRO-Theoretical Informatics and Applications 49 (3), 179-203, 2015
122015
Solving simple stochastic games with few random vertices
H Gimbert, F Horn
arXiv preprint arXiv:0712.1765, 2007
122007
Les jeux d'accessibilité généralisée.
N Fijalkow, F Horn
Technique et Science Informatiques 32 (9-10), 931-949, 2013
102013
The surprizing complexity of reachability games
N Fijalkow, F Horn
92010
Faster algorithms for finitary games
F Horn
International Conference on Tools and Algorithms for the Construction and …, 2007
92007
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
82015
The surprizing complexity of generalized reachability games
N Fijalkow, F Horn
arXiv preprint arXiv:1010.2420, 2010
72010
Two recursively inseparable problems for probabilistic automata
N Fijalkow, H Gimbert, F Horn, Y Oualhadj
International Symposium on Mathematical Foundations of Computer Science, 267-278, 2014
62014
Playing safe
T Colcombet, N Fijalkow, F Horn
34th International Conference on Foundation of Software Technology and …, 2014
62014
Obliging games
K Chatterjee, F Horn, C Löding
International Conference on Concurrency Theory, 284-296, 2010
62010
The system can't perform the operation now. Try again later.
Articles 1–20