Florian Horn - RankMe

44 papers A* 2A 4B 7C 3Misc 1Journal 20Unranked 6

Year	Rank	Type	Title / Venue / Authors
2025	Misc	`conf`	A Coherent Index for Dichotomy in Version-Controlled Repositories. TASE Laurent Bulteau, Pierre-Yves David, Florian Horn, Euxane Tran-Girard
2025	B	`conf`	Incremental Reachability Index. SEA Laurent Bulteau, Pierre-Yves David, Florian Horn, Euxane Tran-Girard
2025	J	`jnl`	On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games. CoRR Vincent Cheval, Florian Horn, Soumyajit Paul, Mahsa Shirmohammadi
2025	A*	`conf`	Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. AAAI Marius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Pérez, Pierre Vandenhove
2024	J	`jnl`	Playing Safe, Ten Years Later. Log. Methods Comput. Sci. Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
2024	J	`jnl`	Revelations: A Decidable Class of POMDPs with Omega-Regular Objectives. CoRR Marius Belly, Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Guillermo A. Pérez, Pierre Vandenhove
2023	J	`jnl`	Games on Graphs. CoRR 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
2023	C	`conf`	The Problem of Discovery in Version Control Systems. LAGOS Laurent Bulteau, Pierre-Yves David, Florian Horn
2022	J	`jnl`	Playing Safe, Ten Years Later. CoRR Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
2020	B	`conf`	Deciding the Existence of Cut-Off in Parameterized Rendez-Vous Networks. CONCUR Florian Horn, Arnaud Sangnier
2020	J	`jnl`	Deciding the existence of cut-off in parameterized rendez-vous networks. CoRR Florian Horn, Arnaud Sangnier
2017	J	`jnl`	Trading Bounds for Memory in Games with Counters. CoRR Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
2017	J	`jnl`	Two Recursively Inseparable Problems for Probabilistic Automata. CoRR Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
2016	A	`conf`	Entropy Games and Matrix Multiplication Games. STACS Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin
2015	J	`jnl`	Entropy Games. CoRR Eugene Asarin, Julien Cervelle, Aldric Degorre, Catalin Dima, Florian Horn, Victor S. Kozyakin
2015	J	`jnl`	Optimal strategy synthesis for request-response games. RAIRO Theor. Informatics Appl. Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann
2015	—	`conf`	Trading Bounds for Memory in Games with Counters. ICALP (2) Nathanaël Fijalkow, Florian Horn, Denis Kuperberg, Michal Skrzypczak
2014	J	`jnl`	Optimal Strategy Synthesis for Request-Response Games. CoRR Florian Horn, Wolfgang Thomas, Nico Wallmeier, Martin Zimmermann
2014	—	`conf`	Playing Safe. FSTTCS Thomas Colcombet, Nathanaël Fijalkow, Florian Horn
2014	—	`conf`	Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj
2013	J	`jnl`	Les jeux d'accessibilité généralisée. Tech. Sci. Informatiques Nathanaël Fijalkow, Florian Horn
2011	J	`jnl`	Self-Stabilizing k-out-of-ℓ Exclusion in Tree Networks. Int. J. Found. Comput. Sci. Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
2011	C	`conf`	The Complexity of Request-Response Games. LATA Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
2010	—	`conf`	How do we remember the past in randomised strategies? GANDALF Julien Cristau, Claire David, Florian Horn
2010	B	`conf`	Obliging Games. CONCUR Krishnendu Chatterjee, Florian Horn, Christof Löding
2010	A*	`conf`	Solving Simple Stochastic Tail Games. SODA Hugo Gimbert, Florian Horn
2010	J	`jnl`	The surprizing complexity of reachability games CoRR Nathanaël Fijalkow, Florian Horn
2009	J	`jnl`	Finitary winning in omega-regular games. ACM Trans. Comput. Log. Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
2009	J	`jnl`	Random Fruits on the Zielonka Tree CoRR Florian Horn
2009	A	`conf`	Random Fruits on the Zielonka Tree. STACS Florian Horn
2009	A	`conf`	Self-Stabilizing k-out-of- IPDPS Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
2009	J	`jnl`	Solving Simple Stochastic Games with Few Random Vertices Hugo Gimbert, Florian Horn
2009	B	`conf`	Stochastic Games with Finitary Objectives. MFCS Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
2008	—	`conf`	Explicit Muller Games are PTIME. FSTTCS Florian Horn
2008	—	`conf`	Graph Games on Ordinals. FSTTCS Julien Cristau, Florian Horn
2008	B	`conf`	On Reachability Games of Ordinal Length. SOFSEM Julien Cristau, Florian Horn
2008	J	`jnl`	Optimal Strategies in Perfect-Information Stochastic Games with Tail Winning Conditions CoRR Florian Horn, Hugo Gimbert
2008	B	`conf`	Optimal Strategy Synthesis in Request-Response Games. ATVA Florian Horn, Wolfgang Thomas, Nico Wallmeier
2008	—	`—`	Random games. Florian Horn
2008	J	`jnl`	Self-stabilizing K-out-of-L exclusion on tree network CoRR Ajoy Kumar Datta, Stéphane Devismes, Florian Horn, Lawrence L. Larmore
2008	B	`conf`	Simple Stochastic Games with Few Random Vertices Are Easy to Solve. FoSSaCS Hugo Gimbert, Florian Horn
2008	C	`conf`	Solving Simple Stochastic Games. CiE Hugo Gimbert, Florian Horn
2007	J	`jnl`	Dicing on the Streett. Inf. Process. Lett. Florian Horn
2007	A	`conf`	Faster Algorithms for Finitary Games. TACAS Florian Horn