Florian Horn

According to our database, Florian Horn authored at least 33 papers between 2007 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Playing Safe, Ten Years Later.

Thomas Colcombet, Nathanaël Fijalkow, Florian Horn

Log. Methods Comput. Sci., 2024

2023

Games on Graphs.

Nathanaël Fijalkow, Nathalie Bertrand, Patricia Bouyer-Decitre, Romain Brenguier, Arnaud Carayol, John Fearnley, Hugo Gimbert, Florian Horn, Rasmus Ibsen-Jensen, Nicolas Markey, Benjamin Monmege, Petr Novotný, Mickael Randour, Ocan Sankur, Sylvain Schmitz, Olivier Serre, Mateusz Skomra

CoRR, 2023

The Problem of Discovery in Version Control Systems.

Laurent Bulteau, Pierre-Yves David, Florian Horn

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2020

Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks.

Florian Horn, Arnaud Sangnier

Proceedings of the 31st International Conference on Concurrency Theory, 2020

2016

Entropy Games and Matrix Multiplication Games.

Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Optimal strategy synthesis for request-response games.

Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann

RAIRO Theor. Informatics Appl., 2015

Entropy Games.

Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin

CoRR, 2015

Trading Bounds for Memory in Games with Counters.

Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak

Proceedings of the Automata, Languages, and Programming - 42nd International Colloquium, 2015

2014

Two Recursively Inseparable Problems for Probabilistic Automata.

Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Playing Safe.

Thomas Colcombet, Nathanaël Fijalkow, Florian Horn

Proceedings of the 34th International Conference on Foundation of Software Technology and Theoretical Computer Science, 2014

2013

Les jeux d'accessibilité généralisée.

Nathanaël Fijalkow, Florian Horn

Tech. Sci. Informatiques, 2013

2011

Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks.

Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore

Int. J. Found. Comput. Sci., 2011

The Complexity of Request-Response Games.

Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn

Proceedings of the Language and Automata Theory and Applications, 2011

2010

The surprizing complexity of reachability games

Nathanaël Fijalkow, Florian Horn

CoRR, 2010

How do we remember the past in randomised strategies?

Julien Cristau, Claire David, Florian Horn

Proceedings of the Proceedings First Symposium on Games, 2010

Solving Simple Stochastic Tail Games.

Hugo Gimbert, Florian Horn

Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

Obliging Games.

Krishnendu Chatterjee, Florian Horn, Christof Löding

Proceedings of the CONCUR 2010 - Concurrency Theory, 21th International Conference, 2010

2009

Finitary winning in omega-regular games.

Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn

ACM Trans. Comput. Log., 2009

Solving Simple Stochastic Games with Few Random Vertices

Hugo Gimbert, Florian Horn

, 2009

Random Fruits on the Zielonka Tree.

Florian Horn

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

Stochastic Games with Finitary Objectives.

Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

Self-Stabilizing k-out-of-<i>l</i> exclusion on tree networks.

Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore

Proceedings of the 23rd IEEE International Symposium on Parallel and Distributed Processing, 2009

2008

Random games.

Florian Horn

PhD thesis, 2008

Self-stabilizing K-out-of-L exclusion on tree network

Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore

CoRR, 2008

Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions

Florian Horn, Hugo Gimbert

CoRR, 2008

On Reachability Games of Ordinal Length.

Julien Cristau, Florian Horn

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 2008

Explicit Muller Games are PTIME.

Florian Horn

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Graph Games on Ordinals.

Julien Cristau, Florian Horn

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Simple Stochastic Games with Few Random Vertices Are Easy to Solve.

Hugo Gimbert, Florian Horn

Proceedings of the Foundations of Software Science and Computational Structures, 2008

Solving Simple Stochastic Games.

Hugo Gimbert, Florian Horn

Proceedings of the Logic and Theory of Algorithms, 2008

Optimal Strategy Synthesis in Request-Response Games.

Florian Horn, Wolfgang Thomas, Nico Wallmeier

Proceedings of the Automated Technology for Verification and Analysis, 2008

2007

Dicing on the Streett.

Florian Horn

Inf. Process. Lett., 2007

Faster Algorithms for Finitary Games.

Florian Horn

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2007