Faster Algorithms for Finitary Games. - Florian Horn 001 (TACAS, 2007)

Dicing on the Streett. - Florian Horn 001 (Inf. Process. Lett., 2007)

Optimal Strategy Synthesis in Request-Response Games. - Florian Horn 001; Wolfgang Thomas; Nico Wallmeier (ATVA, 2008)

Solving Simple Stochastic Games. - Hugo Gimbert; Florian Horn 001 (CiE, 2008)

Simple Stochastic Games with Few Random Vertices Are Easy to Solve. - Hugo Gimbert; Florian Horn 001 (FoSSaCS, 2008)

Graph Games on Ordinals. - Julien Cristau; Florian Horn 001 (FSTTCS, 2008)

Explicit Muller Games are PTIME. - Florian Horn 001 (FSTTCS, 2008)

On Reachability Games of Ordinal Length. - Julien Cristau; Florian Horn 001 (SOFSEM, 2008)

Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions - Florian Horn 001; Hugo Gimbert (CoRR, 2008)

Self-stabilizing K-out-of-L exclusion on tree network - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (CoRR, 2008)

Random games. - Florian Horn 001 (2008)

Self-Stabilizing k-out-of-l exclusion on tree networks. - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (IPDPS, 2009)

Stochastic Games with Finitary Objectives. - Krishnendu Chatterjee; Thomas A. Henzinger; Florian Horn 001 (MFCS, 2009)

Random Fruits on the Zielonka Tree. - Florian Horn 001 (STACS, 2009)

Solving Simple Stochastic Games with Few Random Vertices - Hugo Gimbert; Florian Horn 001 (Logical Methods in Computer Science, 2009)

Finitary winning in omega-regular games. - Krishnendu Chatterjee; Thomas A. Henzinger; Florian Horn 001 (ACM Trans. Comput. Log., 2009)

Obliging Games. - Krishnendu Chatterjee; Florian Horn 001; Christof Löding (CONCUR, 2010)

Solving Simple Stochastic Tail Games. - Hugo Gimbert; Florian Horn 001 (SODA, 2010)

How do we remember the past in randomised strategies? - Julien Cristau; Claire David; Florian Horn 001 (GANDALF, 2010)

The surprizing complexity of reachability games - Nathanaël Fijalkow; Florian Horn 001 (CoRR, 2010)

The Complexity of Request-Response Games. - Krishnendu Chatterjee; Thomas A. Henzinger; Florian Horn 001 (LATA, 2011)

Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. - Ajoy Kumar Datta; Stéphane Devismes; Florian Horn 001; Lawrence L. Larmore (Int. J. Found. Comput. Sci., 2011)

Les jeux d'accessibilité généralisée. - Nathanaël Fijalkow; Florian Horn 001 (Tech. Sci. Informatiques, 2013)

Playing Safe. - Thomas Colcombet; Nathanaël Fijalkow; Florian Horn 001 (FSTTCS, 2014)

Two Recursively Inseparable Problems for Probabilistic Automata. - Nathanaël Fijalkow; Hugo Gimbert; Florian Horn 001; Youssouf Oualhadj (MFCS (1), 2014)

Trading Bounds for Memory in Games with Counters. - Nathanaël Fijalkow; Florian Horn 001; Denis Kuperberg; Michal Skrzypczak (ICALP (2), 2015)

Entropy Games. - Eugene Asarin; Julien Cervelle; Aldric Degorre; Catalin Dima; Florian Horn 001; Victor S. Kozyakin (CoRR, 2015)

Optimal strategy synthesis for request-response games. - Florian Horn 001; Wolfgang Thomas; Nico Wallmeier; Martin Zimmermann 002 (RAIRO Theor. Informatics Appl., 2015)

Entropy Games and Matrix Multiplication Games. - Eugene Asarin; Julien Cervelle; Aldric Degorre; Catalin Dima; Florian Horn 001; Victor S. Kozyakin (STACS, 2016)

Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. - Florian Horn 001; Arnaud Sangnier (CONCUR, 2020)

The Problem of Discovery in Version Control Systems. - Laurent Bulteau; Pierre-Yves David; Florian Horn 001 (LAGOS, 2023)

Games on Graphs. - Nathanaël Fijalkow; Nathalie Bertrand 001; Patricia Bouyer-Decitre; Romain Brenguier; Arnaud Carayol; John Fearnley; Hugo Gimbert; Florian Horn 001; Rasmus Ibsen-Jensen; Nicolas Markey; Benjamin Monmege; Petr Novotný 001; et al. (CoRR, 2023)

Playing Safe, Ten Years Later. - Thomas Colcombet; Nathanaël Fijalkow; Florian Horn 001 (Log. Methods Comput. Sci., 2024)

Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. - Marius Belly; Nathanaël Fijalkow; Hugo Gimbert; Florian Horn 001; Guillermo A. Pérez 001; Pierre Vandenhove (AAAI, 2025)

A Coherent Index for Dichotomy in Version-Controlled Repositories. - Laurent Bulteau; Pierre-Yves David; Florian Horn 001; Euxane Tran-Girard (TASE, 2025)

Incremental Reachability Index. - Laurent Bulteau; Pierre-Yves David; Florian Horn 001; Euxane Tran-Girard (SEA, 2025)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games. - Vincent Cheval; Florian Horn 001; Soumyajit Paul; Mahsa Shirmohammadi (CoRR, 2025)